Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network topology”

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.

At least 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A resilient network recovery framework against cascading failures with deep graph learning

Because of the increasing importance and dependencies of infrastructure networks and the potential for massive cascading failures in real-world network systems, maintenance optimization to effectively reduce system performance loss caused by diverse disruptions is of significant interest among researchers and practitioners. In this work, a new recovery framework was developed to rapidly identify important system components for maintenance to improve network resilience against cascading failures. Here this work provides distinct advantages to determine an optimal maintenance priority by combining real-time network structure importance with other maintenance prioritization based on customer preference. This approach adopts structural graph embedding and deep reinforcement learning to extract real-time network topology information (such as minimum vertex cover) to update the maintenance priority during the recovery process. Based on the case studies on synthetic networks and a US airport network, the proposed recovery framework with real-time network topology awareness shows better performance than other maintenance prioritization strategies regarding resilience enhancement. This work improves the understanding of how the changing network structure influences maintenance effects. It also provides insights of the practical usefulness of advanced deep learning on helping optimal maintenance prioritization to effectively reduce the intensity and extent of cascading failures.

42 ENGINEERING↗
DOE OSTI2020

Topological effects on separation of alkane isomers in metal–organic frameworks

Polymorphism in metal–organic frameworks (MOFs) means that the same chemical building blocks (nodes and linkers) can be used to construct isomeric MOFs with different topological networks. The choice of topology can substantially impact the pore network of the MOF, changing the sizes and shapes of the pores, which has implications for adsorption and separation applications. Here, we look at the influence of topology in 38 polymorphic MOFs on the separation of linear and branched C4–C6 alkane isomers, a separation of great importance to the petrochemical industry. We find that the MOF Cu 2 (1,4-benzenedicarboxylate) in nbo topology (nbo-Cu 2 BDC) has particularly high affinity for linear alkanes due to its small pore size, which excludes the branched isomers. Upon studying this MOF in further detail, we find that it can take either of two conformations: a cubic conformation, which is typical of nbo MOFs, and a unique star conformation that contains 1D triangular and hexagonal channels. The determination of which conformation the MOF will adopt depends on steric effects between the nodes and linkers.

42 ENGINEERING↗
DOE OSTI2021

Sensitivity-Informed Bayesian Inference for Home PLC Network Models with Unknown Parameters

Bayesian inference is used to calibrate a bottom-up home PLC network model with unknown loads and wires at frequencies up to 30 MHz. A network topology with over 50 parameters is calibrated using global sensitivity analysis and transitional Markov Chain Monte Carlo (TMCMC). The sensitivity-informed Bayesian inference computes Sobol indices for each network parameter and applies TMCMC to calibrate the most sensitive parameters for a given network topology. A greedy random search with TMCMC is used to refine the discrete random variables of the network. This results in a model that can accurately compute the transfer function despite noisy training data and a high dimensional parameter space. The model is able to infer some parameters of the network used to produce the training data, and accurately computes the transfer function under extrapolative scenarios.

42 ENGINEERING↗
DOE OSTI2020

Network reconfiguration and distributed energy resource scheduling for improved distribution system resilience

Electric utility companies work to restore as much load as possible after power outages caused by extreme weather events. In this paper, an outage management strategy is proposed to enhance distribution system resilience through network reconfiguration and distributed energy resources (DERs) scheduling. After a line fault, the proposed algorithm can identify radial network topology based on the rank of the incidence matrix. The reconfiguration is implemented by switching tie lines and sectionalizing lines. With the new network topology, an optimal DER scheduling problem is solved to minimize the accumulative cost for dispatchable DER operation and load reduction. Finally, the optimal topology that minimizes the accumulative cost is selected from all radial topologies. The computational workload is relatively low because only linear programming needs to be solved. Using the case studies of the IEEE 69-bus and IEEE 123-bus systems, we consider the worst-case scenarios in which faults occur in the upstream feeder. The simulation results demonstrate that the proposed strategy allows for a relatively high percentage of the load to remain in service after line faults. Furthermore, compared with microgrid-formation approaches, the proposed strategy has advantages when applied to the distribution systems with several normally-open tie lines and low DER penetration.

42 ENGINEERING↗
DOE OSTI2025

Investigating Resiliency of Transportation Network under Targeted and Potential Climate Change Disruptions

Ensuring robustness and resilience in intermodal transportation systems is essential for the continuity and reliability of global logistics. These systems are vulnerable to various disruptions, including natural disasters and technical failures. Despite significant research on freight transportation resilience, investigating the robustness of the system after targeted and climate-change-driven disruption remains a crucial challenge. Drawing on network science methodologies, this study models the interdependencies within the rail and water transport networks and simulates different disruption scenarios to evaluate system responses. Here, we use the data from the U.S. Department of Energy Volpe Center for network topology and tonnage projections. The proposed framework quantifies deliberate, stochastic, and climate-driven infrastructure failure, using higher resolution downscaled multiple Earth System Models’ simulations from Coupled Model Intercomparison Project Phase version 6. We show that the disruptions of a few nodes could have a larger impact on the total tonnage of freight transport than on network topology. For example, the removal of targeted 20 nodes can bring the total tonnage carrying capacity to 30% with about 75% of the rail freight network intact. This research advances the theoretical understanding of transportation resilience and provides practical applications for infrastructure managers and policymakers. By implementing these strategies, stakeholders and policymakers can better prepare for and respond to unexpected disruptions, ensuring sustained operational efficiency in transportation networks.

Climate Change Disruptions↗
DOE OSTI2021

Distributed Data-Driven Power Iteration for Strongly Connected Networks

Here, this paper presents data-driven power iteration to distributively estimate the dominant eigenvalues of an unknown linear time-invariant system. The proposed strategy only requires a single trajectory data or measurements. Furthermore, in order to perform the distributed estimation, the communication network topology can be chosen to be any strongly connected directed graphs. The proposed data-driven power iteration is demonstrated using several numerical examples and is then applied to estimate the generalized algebraic connectivity of cooperative systems and to control the epidemic spreading.

Gusrialdi, Azwirman↗
DOE OSTI2024

Atomic and Electronic Structure in MgO–SiO 2

Understanding disordered structure is difficult due to insufficient information in experimental data. Here, we overcome this issue by using a combination of diffraction and simulation to investigate oxygen packing and network topology in glassy (g-) and liquid (l-) MgO–SiO 2 based on a comparison with the crystalline topology. We find that packing of oxygen atoms in Mg 2 SiO 4 is larger than that in MgSiO 3 , and that of the glasses is larger than that of the liquids. Moreover, topological analysis suggests that topological similarity between crystalline (c)- and g-(l-) Mg 2 SiO 4 is the signature of low glass-forming ability (GFA), and high GFA g-(l-) MgSiO 3 shows a unique glass topology, which is different from c-MgSiO 3 . We also find that the lowest unoccupied molecular orbital (LUMO) is a free electron-like state at a void site of magnesium atom arising from decreased oxygen coordination, which is far away from crystalline oxides in which LUMO is occupied by oxygen’s 3s orbital state in g- and l-MgO–SiO 2 , suggesting that electronic structure does not play an important role to determine GFA. We finally concluded the GFA of MgO–SiO 2 binary is dominated by the atomic structure in terms of network topology.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

A Kinetic Monte Carlo Approach for Simulating Cascading Transmission Line Failure

In this work, cascading transmission line failures are studied through a dynamical model of the power system operating under fixed conditions. The power grid is modeled as a stochastic dynamical system where first-principles electromechanical dynamics are excited by small Gaussian disturbances in demand and generation around a specified operating point. In this context, a single line failure is interpreted in a large deviation context as a first escape event across a surface in phase space defined by line security constraints. The resulting system of stochastic differential equations admits a transverse decomposition of the drift, which leads to considerable simplification in evaluating the quasipotential (rate function) and, consequently, computation of exit rates. Tractable expressions for the rate of transmission line failure in a restricted network are derived from large deviation theory arguments and validated against numerical simulations. Extensions to realistic settings are considered, and individual line failure models are aggregated into a Markov model of cascading failure inspired by chemical kinetics. Cascades are generated by traversing a graph composed of weighted edges representing transitions to degraded network topologies. Numerical results indicate that the Markov model can produce cascades with qualitative power-law properties similar to those observed in empirical cascades.

Kinetic Monte Carlo, rare events, Cascading Failur↗
DOE OSTI2020

A Topology Optimization Framework to Facilitate Adoption of Advanced District Thermal Energy Systems

Advanced district thermal energy systems, which circulate water at temperatures near ambient conditions, and facilitate the utilization of waste heat and renewable thermal sources, can lower the carbon-intensity of urban districts, advancing the U.N. Sustainable Development Goals. Optimization of the network topology — the selection of the best subset of buildings and the best network to connect them, to minimize life cycle cost — can increase adoption of these system in appropriate applications. The potential "solution space" of the topology optimization problem grows factorially with the number of buildings in the district, motivating the consideration of a design heuristic. In this study, a heuristic for the network selection was evaluated with an exhaustive search, for a prototypical four-building district. For the prototypical district considered, the heuristic was effective in selecting an optimal network topology. Additionally, it was found that, in this case, the selection of the subset of buildings was more influential on the life cycle cost than the selection of the network topology. This work is part of a larger effort to develop a topology optimization framework for district thermal energy systems, which is anticipated to address barriers to adoption of ambient-temperature systems.

28 EE - Advanced Manufacturing Office (EE-5A)↗
DOE OSTI2023

Quantum algorithms for geologic fracture networks

Abstract Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10–1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

58 GEOSCIENCES↗
DOE OSTI2020

Multiple social platforms reveal actionable signals for software vulnerability awareness: A study of GitHub, Twitter and Reddit

Software vulnerabilities are flaws in computer systems that leave users open to attack. In many cases, these vulnerabilities go unnoticed and remain unresolved in codebases. Thus, awareness of software vulnerabilities among the public is crucial to ensure effective cybersecurity practices, the development of high quality software, and ultimately national security. This awareness can be better understood by studying the spread and evolution of software vulnerability discussions in online communities. This work is the first to evaluate and contrast how discussions about software vulnerabilities spread on three social platforms -- Twitter, GitHub, and Reddit. To lay the groundwork, we showcase a novel fundamental framework for measuring information spread that identifies the spread mechanisms and observables across platforms, the units of information, and the groups of measurements that can be applied to focus on a specific phenomena e.g., information cascades. We then analyze and contrast social network topologies for three example social networks and measure the scale and speed of the spread of discussion of specific vulnerabilities to understand how far and how widely they spread, how many users participate in discussions, and the duration of their spread. To demonstrate the awareness of more impactful software vulnerabilities, a subset of our analysis focuses on vulnerabilities targeted during recent major cyber attacks as well as vulnerabilities exploited by advanced persistent threat groups. We discover that usually, vulnerability discussions start on GitHub, before occurring on Twitter and Reddit. While studying how some user-level and content-level characteristics influence vulnerability spread, we observe that Twitter discussions started by users predicted to be humans have larger size, breadth, depth, adoption rate, lifetime, and structural virality compared to those started by users predicted to be bots. On Reddit, we contrast the differences in thread structure that originate from posts with positive, negative and neutral polarity. We find that posts that are positive have larger, deeper and wider discussions compared to negative and neutral posts. We anticipate the results of our analysis to not only increase the understanding of software vulnerability awareness but also inform models for simulating information spread across multiple social environments online.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Guide to Conquer the Biological Network Era Using Graph Theory

Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities. In this article, we discuss the basic graph theory concepts and the various graph types, as well as the available data structures for storing and reading graphs. In addition, we describe several network properties and we highlight some of the widely used network topological features. We briefly mention the network patterns, motifs and models, and we further comment on the types of biological and biomedical networks along with their corresponding computer- and human-readable file formats. Finally, we discuss a variety of algorithms and metrics for network analyses regarding graph drawing, clustering, visualization, link prediction, perturbation, and network alignment as well as the current state-of-the-art tools. We expect this review to reach a very broad spectrum of readers varying from experts to beginners while encouraging them to enhance the field further.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Efficient Topology Design Algorithms for Power Grid Stability

The dynamic response of power grids to small disturbances influences their overall stability. This letter examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes H 2 -norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. Finally, the efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Pressure-Driven Changes in the Electronic Bonding Environment of GeO 2 Glass above Megabar Pressures

Noncrystalline oxides under pressure undergo gradual structural modifications, highlighted by the formation of a dense noncrystalline network topology. The nature of the densified networks and their electronic structures at high pressures may account for the mechanical hardening and the anomalous changes in electromagnetic properties. Despite its importance, direct probing of the electronic structures in amorphous oxides under compression above the Mbar pressure (>100 GPa) is currently lacking. Here, we report the observation of pressure-driven changes in electronic configurations and their delocalization around oxygen in glasses using inelastic X-ray scattering spectroscopy (IXS). In particular, the first O K-edge IXS spectra for compressed GeO 2 glass up to 148 GPa, the highest pressure ever reached in an experimental study of GeO 2 glass, reveal that the glass densification results from a progressive increase of oxygen proximity. While the triply coordinated oxygen [3] O is dominant below ~50 GPa, the IXS spectra resolve multiple edge features that are unique to topologically disordered [4] O upon densification above 55 GPa. Topological compaction in GeO 2 glass above 100 GPa results in pronounced electronic delocalization, revealing the contribution from Ge d-orbitals to oxide densification. Strong correlations between the glass density and the electronic configurations beyond the Mbar conditions highlight the electronic origins of densification of heavy-metal-bearing oxide glasses. Furthermore, current experimental breakthroughs shed light on the direct probing of the electronic density of states in high-Z oxides above 1 Mbar, offering prospects for studies on the pressure-driven changes in magnetism, superconductivity, and electronic transport properties in heavy-metal-bearing oxides under compression.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Graph Analytics on Jellyfish topology

Because large unstructured datasets is important for many science domains, distributed graph analytics is critical to many scientists. Unfortunately, obtaining scaling and performance for irregular communication is challenging because contemporary network interconnects are primarily designed to maximize bandwidths of fixed-neighborhoods large-message exchanges (e.g., stencils). Although there is no consensus on the “best” network topologies for irregular communication, unstructured graph-based interconnects can be more suitable. We analyze three popular graph workloads – clustering, pattern enumeration, and traversal — on comparable networks (in terms of resources and costs) constructed from Jellyfish Random Regular, Dragonfly and Fat tree topologies, varying the routing algorithms. Using packet-level simulations, we demonstrate up to 60% improvement in communication time with Jellyfish due to diversity of the short paths between arbitrary endpoints, which can reduce overall network stalls and congestion.

Graph Analytics, network topology, interconnect, H↗
DOE OSTI2024

Distributed Automatic Generation Control Considering DPV Using T&D Dynamic Co-Simulation

The increasing adoption of distributed energy resources (DERs) over the last decade warrants a reconsideration of control of generation resources. This paper proposes a distributed Automatic Generation Control (AGC) using transmission-and-distribution (T&D) dynamic co-simulation framework for the efficient DPV frequency regulation services. The co-simulation framework allows AGC units to exchange the information for distributed AGC, based on their adopted communication network topology. As a result, a cost-effective automatic generation control is achieved with DPV and conventional generators. The proposed distributed AGC is based on the gossip algorithm in which the neighboring AGC units share the relevant local information with each other and updates their share of AGC regulation signal. Distributed photovoltaics (DPV) unit contribute to AGC response based on their headroom capacity via DER aggregators. The algorithm is tested on IEEE-14 bus transmission system under conditions of generation failure and random load variation to observe effective frequency regulations service offered by DPVs and other AGC units. The study shows that DPV can effectively participate in AGC with the proposed distributed control framework.

automatic generation control↗