NET DESIGNER: A visual tool for writing nuclear networks for MESA and other network codes
Explore the source record for details and available documents.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
SEARCH · Engineering Papers
Results for “NETWORK”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Secure Software-Defined Networking; Policy Enforcement in Hybridized Networks.
Abstract not provided.
Rindels, Raymond↗
Predicting Voltage Changes in Low-Voltage Secondary Networks using Deep Neural Networks
Explore the source record for details and available documents.
Yusuf, Jubair↗
The Robustness of Spiking Neural Networks in Communication and its Application towards Network Efficiency in Federated Learning
Explore the source record for details and available documents.
Nguyen, Manh↗
Challenges of Integrating NASAs Space Communication Networks
The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a significant obstacle for integration. Over the past few decades of use, user missions and network personnel alike have grown accustomed to the processes by which services are provided by the NASA communications and navigation networks. The culture established by each network has created several challenges that need to be overcome in order to effectively integrate the networks. As with any change, there has been resistance, an apprehension to explore automation of existing processes, and a working environment that attempts to indirectly influence change without mandating compliance. Overcoming technical and cultural challenges is essential to successfully integrating the networks and although the challenges are numerous, the integration of the networks promises a more efficient space communications network for NASA and its customers, as well as potential long-term cost savings to the agency. This paper, Challenges of Integrating NASA Legacy Communications Networks, will provide a brief overview of the current NASA space communications networks as well as the an overview of the process implemented while performing the SCaN Trade Studies and an introduction to the requirements driving integration of the SCaN Networks. This paper will describe in detail the challenges experienced, both technical and cultural, while working with NASA space communications network-specific personnel. The paper will also cover lessons learned during the performance of architecture trade studies and provide recommendations for ways to improve the process.
Reinert, Jessica M.↗
Challenges of Integrating NASA's Space Communications Networks
The transition to new technology, innovative ideas, and resistance to change is something that every industry experiences. Recent examples of this shift are changing to using robots in the assembly line construction of automobiles or the increasing use of robotics for medical procedures. Most often this is done with cost-reduction in mind, though ease of use for the customer is also a driver. All industries experience the push to increase efficiency of their systems; National Aeronautics and Space Administration (NASA) and the commercial space industry are no different. NASA space communication services are provided by three separately designed, developed, maintained, and operated communications networks known as the Deep Space Network (DSN), Near Earth Network (NEN) and Space Network (SN). The Space Communications and Navigation (SCaN) Program is pursuing integration of these networks and has performed a variety of architecture trade studies to determine what integration options would be the most effective in achieving a unified user mission support organization, and increase the use of common operational equipment and processes. The integration of multiple, legacy organizations and existing systems has challenges ranging from technical to cultural. The existing networks are the progeny of the very first communication and tracking capabilities implemented by NASA and the Jet Propulsion Laboratory (JPL) more than 50 years ago and have been customized to the needs of their respective user mission base. The technical challenges to integrating the networks are many, though not impossible to overcome. The three distinct networks provide the same types of services, with customizable data rates, bandwidth, frequencies, and so forth. The differences across the networks have occurred in effort to satisfy their user missions' needs. Each new requirement has made the networks more unique and harder to integrate. The cultural challenges, however, have proven to be a significant obstacle for integration. Over the past few decades of use, user missions and network personnel alike have grown accustomed to the processes by which services are provided by the NASA communications and navigation networks. The culture established by each network has created several challenges that need to be overcome in order to effectively integrate the networks. As with any change, there has been resistance, an apprehension to explore automation of existing processes, and a working environment that attempts to indirectly influence change without mandating compliance. Overcoming technical and cultural challenges is essential to successfully integrating the networks and although the challenges are numerous, the integration of the networks promises a more efficient space communications network for NASA and its customers, as well as potential long-term cost savings to the agency. This paper, Challenges of Integrating NASA Legacy Communications Networks, will provide a brief overview of the current NASA space communications networks as well as the an overview of the process implemented while performing the SCaN Trade Studies and an introduction to the requirements driving integration of the SCaN Networks. This paper will describe in detail the challenges experienced, both technical and cultural, while working with NASA space communications network-specific personnel. The paper will also cover lessons learned during the performance of architecture trade studies and provide recommendations for ways to improve the process.
Systems Integration↗
Using the D-Wave 2X Quantum Computer to Explore the Formation of Global Terrorist Networks
Social networks with signed edges (+/-) play an important role in an area of social network theory called structural balance. In these networks, edges represent relationships that are labeled as either friendly (+) or hostile (-). A signed social network is balanced only if all cycles of three or more nodes in the graph have an odd number of hostile edges. A fundamental property of a balanced network is that it can be cleanly divided into 2 factions, where all relationships within each faction are friendly, and all relationships between members of different factions are hostile. The more unbalanced a network is, the more edges will fail to adhere to this rule, making factions more ambiguous. Social theory suggests unbalanced networks should be unstable, a finding that has been supported by research on gangs, which shows that unbalanced relationships are associated with greater violence, possibly due to this increased ambiguity about factional allegiances (Nakamura et al). One way to estimate the imbalance in a network, if only edge relationships are known, is to assign nodes to factions that minimize the number of violations of the edge rule described above. This problem is known to be computationally NP-hard. However, Facchetti et al. have pointed out that it is equivalent to an Ising model with a Hamiltonian that effectively counts the number of edge rule violations. Therefore, finding the assignment of factions that minimizes energy of the equivalent Ising system yields an estimate of the imbalance in the network. Based on the Ising model equivalence of the signed-social network balance problem, we have used the D-Wave 2X quantum annealing computer to explore some aspects of signed social networks. Because connectivity in the D-Wave computer is limited to its particular native topology, arbitrary networks cannot be represented directly. Rather, they must be “embedded” using a technique in which multiple qubits are chained together with special weights to simulate a collection of nodes with the required connectivity. This limits the size of a fully connected network in the D-Wave to about 50 simulated nodes, using all of the approximately 1150 qubits in the machine. In order to keep within this limitation, while exploring a problem of potential social relevance, we constructed time series of historical network snapshots from Stanford’s Mapping Militants Project, where nodes represent militant organizations, and edges represent either alliances or rivalries between organizations. We constructed two series from different theaters – Iraq and Syria – spanning timelines from about 2000 to 2016, each with networks whose maximum size was in the 20-30 node range. Computationally, our experience suggests D-Wave technology is promising, providing fast, nearly constant scaling of computational effort in the main part of the calculation that relies on the quantum annealing cycle. However, the cost of embedding an arbitrary network of interest in the D-Wave native topology scales poorly. If the embedding cost can be amortized relative to the annealing cycle, it may be possible to gain a substantial advantage over classical computing methods, provided a large enough network can be accommodated by partitioning into subnetworks or some similar strategy. In terms of our application to networks of militant organizations, we found a rise in network imbalance in the Syrian theater that appears to correspond roughly with the entrance of the Islamic State into a milieu already populated with other groups, a phenomenon we plan to explore in more detail. In these very preliminary results, we also noticed that during at least one period where both the size and imbalance of the network increased substantially, the imbalance per edge seemed to remain fairly steady. This may suggest some adaptive behavior among the participating factions, which may also warrant further exploration.
97 MATHEMATICS AND COMPUTING↗
The Transactive Energy Network Template Metamodel
While transactive energy, which is defined as an allocation of electricity based on dynamically discovered values or prices, has been extensively studied, its uptake and use has been slow. This report describes a tool, the transactive network template, which should hasten the creation and uptake of transactive energy networks. Some basic principles of transactive energy are familiar from existing wholesale electricity markets. Locational prices are calculated today for zones within bulk electric transmission systems. Locational prices differ while accounting for the locational costs of electricity generation and the losses and constraints incurred when electricity is transmitted from generators and distributed to consumers. A transactive energy network might include these transmission zones. However, current research strives to apply transactive energy also in electricity distribution circuits, buildings, and even for individual generating and consuming devices. At the same time, researchers explore how to apply transactive energy in real time during increasingly shorter time intervals. Automated computational agents become necessary as transactive energy becomes applied to smaller circuit zones and at faster dynamic timescales. A transactive energy network is an example of a multi-agent system. Each zone in the network is represented by its transactive agent, which makes decisions for and acts on behalf of a business entity that is responsible for and manages one of the circuit regions. A transactive energy network is also an example of a decentralized, distributed control system. Control decisions and responsibilities are distributed among the network’s transactive agents. The transactive agents are independent; that is, there typically is no centralized authority or oversight function. Instead, transactive agents exchange transactive signals and thereby negotiate the prices and quantities of electricity that they will exchange. Initially, the circuit regions and responsibilities of transactive agents appear to be very dissimilar. Each circuit region may comprise transmission, distribution, or building-level circuits. Each has a unique position and electrical connectivity within the transactive energy network. Each possesses unique assets that either generate or consume electricity, and these (e.g., renewable energy generator, diesel generator, aggregate utility load, building load, space conditioning, refrigerator, etc.) may further differ in their price flexibility and in their strategies for responding to dynamic electricity prices. Given such diversity, an implementer’s first inclination might be to start from scratch to define all these devices and to engineer their seemingly unique interactions. Given that each implementer’s perspective may be narrow within a transactive energy network, it is unlikely that uniquely engineered systems would interact well. This is where the transactive network template is applicable. The transactive network template is a metamodel that has been developed to guide implementers as they configure their own transactive agent within a network of such agents. The object-oriented design of the transactive network template provides basic code object types that may be used and extended by implementers to represent each of the assets in their circuit region. These objects further facilitate the transactive agent’s necessary computations, which are divided among responsibilities to schedule power usage, balance electric supply and demand, and coordinate the exchange of electricity with the other transactive agents. This report addresses the conceptual transactive network template design. Implementers are directed to more formal design documents and reference implementations. A Python™-based1 reference implementation of the transactive network template has been coded, and three implementations have been configured to represent a national laboratory and two university campuses. Version 2 of the transactive node template generalizes the market class and its methods to facilitate multiple, and more diverse market coordination mechanisms than were facilitated by and demonstrated using Version 1. Version 3 includes new Appendix B, which addresses the designs of methods that would make dynamic prices track approved electricity rates. In the future, the author wishes to make the transactive network template more generally applicable to networks that require more accurate power flow. Development of the transactive network template is jointly funded by the U.S. Department of Energy (DOE) Energy Efficiency and Renewable Energy and the DOE Office of Electricity. In late 2015, one of the first projects to be funded by the DOE Grid Laboratory Modernization Laboratory Consortium was the Clean Energy and Transactive Campus project, led by Pacific Northwest National Laboratory. DOE funds were matched by an investment by the Washington Department of Commerce through its Clean Energy Fund. The transactive network template was developed to guide the implementation of transactive energy networks within this project’s scope.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Reliability Assessment of Safety-Critical Network Communication in a Digitalized Nuclear Power Plant
In analog instrumentation and control (I and C) systems for nuclear power plants (NPPs), most connections are comprised of hardwired point-to-point types. Since they are based on analog technologies, they are fragile to noise and require analog-to-digital conversion time. Therefore, many NPPs have adopted communication network for the exchange of safety-critical data between programmable logic controllers (PLCs) in digital I and C systems to effectively accommodate a huge number of field controllers. However, the primary issue of digital network communication in a safety-critical system involves potential hazards, such as partial or total loss of communication between PLCs, which may result in a failure of safety critical signal generation when it is needed. Therefore, the probability that a safety-critical system in digitalized NPP becomes unsafe due to a network failure must be evaluated to quantify the risk of digital I and C system. In Korea, the Engineered Safety Feature-Component Control System (ESF-CCS) was developed as one of the digital safety-critical system in Advanced Power Reactor- 1400 (APR-1400). The function of a digital engineered safety feature (ESF) actuation system and field actuator controllers of conventional NPPs are performed by the ESF-CCS. In this system, safety-critical network, High Reliable- Safety Data Network (HR-SDN), was employed for the safety-critical data transmission from group controllers (GCs) to loop controllers (LCs). In this study, a framework for assessing the reliability of a HR-SDN network communication between GCs and LCs in the ESF-CCS in addition to a fault-tree model for ESF components considering network failure between GCs and LCs were developed to assess the plant risk effect of a newly developed digitalized ESF-CCS. Based on the case studies and cut set analysis, the risk effect of network failure on plant risk and the important risk contributors of network failure were quantitatively addressed. A framework for identifying the potential hazardous states of network communication in the ESFCCS was proposed. In addition, a fault-tree model for network communication failure was developed to estimate the risk effects of network failure between the GCs and LCs on ESF-CCS signal failure. The developed fault-tree model was then applied to several case studies. The fault-tree model of ESF-CCS signal failure for ESF components required for various mitigation actions regarding NPP DBAs was designed by considering the identified hazardous states of network failure that would result in a failure to provide input signals to the corresponding LC. As a sensitivity study, three case studies were performed based on the periodic test methods for hardware components in HR-SDN module and their test intervals in this study. The quantitative results for three case studies demonstrated that the probability of overall network communication failure, which was calculated as the sum of the failure probability associated with each failure cause, contributed up to 1.58% on the Small-LOCA CD frequency. The results also revealed the important basic events related to network failure in the case studies which included CCF of hardware and software in HR-SDN module. This study is expected to provide insight into the development of the fault-tree model for the network failure in digital I and C system and into the quantification of the risk effect of network failure for safety-critical data transmission in NPPs. As a further study, the risk effects of network failure in the ESF-CCS on the plant risk can be estimated in a more detailed manner by analyzing the failure modes and causes in a sub-component level and the fault detection coverage of the fault tolerance techniques for network failure implemented in ESF-CCS after the detailed configuration of ESF-CCS is decided. In terms of the failure of manual ESF actuation, the relationship among the human action failures must be investigated to consider multiple human error condition since ESF-CCS provides multiple manual actuation to assure the diversity of the system. Since the conventional HEP method cannot accommodate the multiple conditions in a fault tree, condition-based human reliability assessment (CBHRA) method or the dynamic human reliability modeling approach can be applied to include a complex relationship among the automated safety signal generation and the human operator's manual actuation, avoiding the optimistic estimation of HEP of the human action failure.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network
A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.
Cheung, Kar-Ming↗
The Evolution of Lidar Networks: A US Perspective
Atmospheric aerosols and clouds play an important role in climate by directly scattering and absorbing sunlight. Aerosol-cloud interactions modify the particle properties causing indirect effects, alter aerosol deposition and rainfall, and contribute substantially to the uncertainties in predicting climate effects. Aerosols also affect air quality and both constituents modulate boundary layer dynamics to a certain extent, in turn impacting aerosol transport and aerosol-cloud interactions. The spatiotemporal distribution of aerosol and cloud layers is thus important, and lidar remains the primary instrument for determining the vertical distribution of aerosols and thin clouds. Lidar still provides important information for opaque cloud layers by determining base heights. Combined lidar and radar data provide a comprehensive coverage of aerosol and cloud vertical distributions, and thus locations where and when they interact. Lidar data provide a means of constraining column aerosol loading observations (e.g. AOD) to vertical extents. In addition, lidar has proven effective at determining a proxy for boundary layer height by examining aerosol gradients and/or cloud base heights in lidar profiles. Polarized lidars provide additional information on particle shape, allowing estimates of cloud phase and separation of dust or smoke from sulfate and sea salt aerosols. Given the importance of lidar observations and a critical maturation in technology and retrieval techniques, several organizations began to build operational lidar networks around 2000. The European Aerosol Research Lidar Network (EARLINET) was started as a research focused network of advanced lidars across Europe. The Asian Dust Lidar Network (ADNET) was also developed as a regional network providing lidar profiles of dust and pollution across Eastern Asia. In the US, the NASA Micro Pulse Lidar Network (MPLNET) was created to provide global lidar profiling at key sites in the NASA Aerosol Robotic Network (AERONET). The Network for the Detection of Atmospheric Composition Change (NDACC) pre-dates these networks and many sites have lidar, but it is not strictly a lidar network and at the time focused less on the lower troposphere. Finally, there were already existing ceilometer networks operated by various meteorological agencies, but in particular here in the US the profile data has not been available. The ceilometer networks were used to provide only clouds base heights and estimates of PBL height. Thus, the distinguishing feature between lidar and ceilometer networks was historically the ability to actually provide profile information (in addition to differences in wavelength, and advanced retrievals such as the raman technique). As time progressed, each lidar network matured and developed more operational capabilities and data sets, coupled with viable data centers providing DAAC services and access to near-real-time (NRT) data. In 2008 under WMO guidance, the Global Atmospheric Watch (GAW) Aerosol Lidar Observation Network (GALION) was formed as a global network made up of the existing lidar networks. The goal was to share information, best practices, and develop frameworks and techniques for quality data. GALION grew to include several other regional lidar networks and this has led to a vast increase in quality lidar sites worldwide.
Welton, Ellsworth J.↗
Do not forget the electrons: Extending moderately-sized nuclear networks for multidimensional hydrodynamic codes
Context.Nuclear networks are widely used coupled with hydrodynamical simulations of explosive scenarios to account for the change of nuclear species and energy generation rate due to nuclear reactions. In this way, there is a feedback mechanism between the hydrodynamical state and the nuclear processes. Unfortunately, the timescale of nuclear reactions is orders of magnitude smaller than the dynamical timescale that drives hydrodynamical simulations. Therefore, these nuclear networks are usually very small, reduced in most cases to a dozen elements, especially when simulations are carried out in more than one dimension. Aims.We present here an extended nuclear network, with 90 species, designed for being coupled with hydrodynamic simulations, which includes neutrons, protons, electrons, positrons, and the corresponding neutrino and anti-neutrino emission. This network is also coupled with temperature, making it extremely robust and, together with its size, unique of its kind. The inclusion of electron captures on free protons makes the network very appropriate for multidimensional studies of Type Ia supernova explosions, especially when the exploding object is a massive white dwarf. Methods.We perform several tests that are relevant to simulate explosive scenarios, such as Type Ia supernovae and core-collapse supernovae. We compare the results of the 90 nuclei network with a standardα-chain network with 14 elements to evaluate the differences in the energy generation rate. We also evaluate the relevance of including the electrons in the network in terms of generated yields and how it affects the pressure of a degenerate fluid such as that of white dwarfs. The results obtained with the 90-nuclei network have been verified with a much larger 2000-nuclei network built from REACLIB (WinNet), in terms of nuclear energy generation rate, pressure, and produced yields. Results.The results obtained with the proposed medium-sized network compare fairly well, to a few percent, with those computed withWinNetin scenarios reproducing the gross physical conditions of current Type Ia supernova explosion models. In those cases where the carbon and oxygen fuel ignites at high density, the high-temperature plateau typical of the nuclear statistical equilibrium regime is well defined and stable, allowing large integration time steps. We show that the inclusion of electron captures on free protons substantially improves the estimation of the electron fraction of the mixture. Therefore, the pressure is better determined than in networks where electron captures are excluded, which will ultimately lead to more reliable hydrodynamic models. Explosive combustion of helium at low density, occurring near the surface layer of a white dwarf, is also better described with the proposed network, which gives nuclear energy generation rates much closer toWinNetthan typical reduced alpha networks. Conclusions.A nuclear network withN= 90 species, including electrons, aimed at multidimensional calculations of supernova explosions is described and verified. The proposed network is suitable for the study of Type Ia supernova explosions because it provides better values of pressure and electron abundance than other existing networks with smaller or even a similar size but without including electron capture processes.
Astronomy & Astrophysics↗
Large-Scale Coronal Heating from "Cool" Activity in the Solar Magnetic Network
In Fe XII images from SOHO/EIT, the quiet solar corona shows structure on scales ranging from sub-supergranular (i.e., bright points and coronal network) to multi-supergranular (large-scale corona). In Falconer et al 1998 (Ap.J., 501, 386) we suppressed the large-scale background and found that the network-scale features are predominantly rooted in the magnetic network lanes at the boundaries of the supergranules. Taken together, the coronal network emission and bright point emission are only about 5% of the entire quiet solar coronal Fe XII emission. Here we investigate the relationship between the large-scale corona and the network as seen in three different EIT filters (He II, Fe IX-X, and Fe XII). Using the median-brightness contour, we divide the large-scale Fe XII corona into dim and bright halves, and find that the bright-half/dim half brightness ratio is about 1.5. We also find that the bright half relative to the dim half has 10 times greater total bright point Fe XII emission, 3 times greater Fe XII network emission, 2 times greater Fe IX-X network emission, 1.3 times greater He II network emission, and has 1.5 times more magnetic flux. Also, the cooler network (He II) radiates an order of magnitude more energy than the hotter coronal network (Fe IX-X, and Fe XII). From these results we infer that: 1) The heating of the network and the heating of the large-scale corona each increase roughly linearly with the underlying magnetic flux. 2) The production of network coronal bright points and heating of the coronal network each increase nonlinearly with the magnetic flux. 3) The heating of the large-scale corona is driven by widespread cooler network activity rather than by the exceptional network activity that produces the network coronal bright points and the coronal network. 4) The large-scale corona is heated by a nonthermal process since the driver of its heating is cooler than it is. This work was funded by the Solar Physics Branch of NASA's office of Space Science through the SR&T Program and the SEC Guest Investigator Program.
Falconer, D. A.↗
Prevalence and scalable control of localized networks
The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.
42 ENGINEERING↗
Flow Channeling in Fracture Networks: Characterizing the Effect of Density on Preferential Flow Path Formation
Flow channelization is a commonly observed phenomenon in fractured subsurface media where the flow of fluids is restricted primarily to highly transmissive fracture networks surrounded by a low-permeability rock matrix. The multiscale structural heterogeneity of these networks results in multiscale flow channelization where preferential flow paths form at length scales ranging from the entire system down to the subfracture size. We present an analysis of how one of the largest scales in fractured media, the network density, influences the degree of flow channeling that occurs using an ensemble of semigeneric three-dimensional discrete fracture network (DFN) simulations. We construct 10 DFNs, whose fracture lengths follow a power law distribution, at four densities for a total of 40 networks. We characterize their structure in terms of the network topology and geometry. Eulerian and Lagrangian observations of the steady-state flow fields obtained within the networks are used to quantify the degree of flow channelization at the network scale. We introduce a measure for the importance-ranking/hierarchy of different flow paths in the network using graph-based analysis of Lagrangian transport by which the degree of flow channeling between networks is compared. These flow observations are then linked to the structural properties of the networks. In general, network-scale flow channeling decreases as the network density increases. However, at low densities, there is more uniform flow within the entire connected network than in high-density networks. We also demonstrate how standard transport observables can be used to infer the degree of flow channelization occurring within a fracture network.
58 GEOSCIENCES↗
An Investigation of Synchrony in Transport Networks
The cumulative degree distributions of transport networks, such as air transportation networks and respiratory neuronal networks, follow power laws. The significance of power laws with respect to other network performance measures, such as throughput and synchronization, remains an open question. Evolving methods for the analysis and design of air transportation networks must address network performance in the face of increasing demands and the need to contain and control local network disturbances, such as congestion. Toward this end, we investigate functional relationships that govern the performance of transport networks; for example, the links between the first nontrivial eigenvalue of a network's Laplacian matrix - a quantitative measure of network synchronizability - and other global network parameters. In particular, among networks with a fixed degree distribution and fixed network assortativity (a measure of a network's preference to attach nodes based on a similarity or difference), those with the small eigenvalue are shown to be poor synchronizers, to have much longer shortest paths and to have greater clustering in comparison to those with large. A simulation of a respiratory network adds data to our investigation. This study is a beginning step in developing metrics and design variables for the analysis and active design of air transport networks.
Kincaid, Rex K.↗
Space Communications Responsive to Events Across Missions (SCREAM): An Investigation of Network Solutions for Transient Science Space Systems
Space Communications Responsive to Events Across Missions (SCREAM): An Investigation of Network Solutions for Transient Science Space Systems The National Academies have prioritized the pursuit of new scientific discoveries using diverse and temporally coordinated measurements from multiple ground and space-based observatories. Networked communications can enable such measurements by connecting individual observatories and allowing them to operate as a cohesive and purposefully designed system. Timely data flows across terrestrial and space communications networks are required to observe transient scientific events and processes. Currently, communications to space-based observatories experience large latencies due to manual service reservation and scheduling procedures, intermittent signal coverage, and network capacity constraints. If space communications network latencies could be reduced, new discoveries about dynamic scientific processes could be realized. However, science mission and network planners lack a systematic framework for defining, quantifying and evaluating timely space data flow implementation options for transient scientific observation scenarios involving multiple ground and space-based observatories. This dissertation presents a model-based systems engineering approach to investigate and develop network solutions to meet the needs of transient science space systems. First, a systematic investigation of the current transient science operations of the National Aeronautics and Space Administration’s (NASA) Tracking and Data Relay Satellite (TDRS) space data network and the Neil Gehrels Swift Observatory resulted in a formal architectural model for transient science space systems. Two methods individual missions may use to achieve timely network services were defined, quantitatively modeled, and experimentally compared. Next, the architectural model was extended to describe two alternative ways to achieve timely and autonomous space data flows to multiple space-based observatories within the context of a purposefully designed transient science observation scenario. A quantitative multipoint space data flow modeling method based in queueing theory was defined. General system suitability metrics for timeliness, throughput, and capacity were specified to support the evaluation of alternative network data flow implementations. A hypothetical design study was performed to demonstrate the multipoint data flow modeling method and to evaluate alternative data flow implementations using TDRS. The merits of a proposed future TDRS broadcast service to implement multipoint data flows were quantified and compared to expected outcomes using the as-built TDRS network. Then, the architectural model was extended to incorporate commercial network service providers. Quantitative models for Globalstar and Iridium short messaging data services were developed based on publicly available sources. Financial cost was added to the set of system suitability metrics. The hypothetical design study was extended to compare the relative suitability of the as-built TDRS network with the commercial Globalstar and Iridium networks. Finally, results from this research are being applied by NASA missions and network planners. In 2020, Swift implemented the first automated command pipeline, increasing its expected gravitational wave follow-up detection rate by greater than 400%. Current NASA technology initiatives informed by this research will enable future space-based observatories to become interoperable sensing devices connected by a diverse ecosystem of network service providers.
Christopher J. Roberts↗
Enabling parallel simulation of large-scale HPC network systems
Here, with the increasing complexity of today’s high-performance computing (HPC) architectures, simulation has become an indispensable tool for exploring the design space of HPC systems—in particular, networks. In order to make effective design decisions, simulations of these systems must possess the following properties: (1) have high accuracy and fidelity, (2) produce results in a timely manner, and (3) be able to analyze a broad range of network workloads. Most state-of-the-art HPC network simulation frameworks, however, are constrained in one or more of these areas. In this work, we present a simulation framework for modeling two important classes of networks used in today’s IBM and Cray supercomputers: torus and dragonfly networks. We use the Co-Design of Multi-layer Exascale Storage Architecture (CODES) simulation framework to simulate these network topologies at a flit-level detail using the Rensselaer Optimistic Simulation System (ROSS) for parallel discrete-event simulation. Our simulation framework meets all the requirements of a practical network simulation and can assist network designers in design space exploration. First, it uses validated and detailed flit-level network models to provide an accurate and high-fidelity network simulation. Second, instead of relying on serial time-stepped or traditional conservative discrete-event simulations that limit simulation scalability and efficiency, we use the optimistic event-scheduling capability of ROSS to achieve efficient and scalable HPC network simulations on today’s high-performance cluster systems. Third, our models give network designers a choice in simulating a broad range of network workloads, including HPC application workloads using detailed network traces, an ability that is rarely offered in parallel with high-fidelity network simulations
97 MATHEMATICS AND COMPUTING↗