Search NASA⌕ Search

SEARCH · Search NASA

Results for “network topology optimization”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRSDate not supplied

Optimal Communication Topology Determination and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach to sensors selection and network topology determination for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes minimum estimation error, maximum airspace coverage, minimum communication time and power consumption while guaranteeing the system observability and providing in-time quality information to a monitoring observer. The developed algorithm uses multi-objective optimization strategy taking into account trade-offs between conflicting objectives and relaxations for in time implementation. It is implemented utilizing graph theoretic tools. The approach is validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace.

Distributed sensing↗
DOE OSTI2020

Bus Clustering for Distribution Grid Topology Identification

Recovering the distribution grid topology is essential to perform several distribution system operator functions. Many algorithms that address the topology recovery problem have already been proposed in the literature. Most are based on a priori information regarding which buses are fed by which substation; however, this information might not be available because frequent grid reconfigurations change the distribution grid portion connected to each substation. This paper addresses the problem of assigning every substation the set of buses that it is feeding, given field data. First, the aforementioned task is cast as a nonconvex optimization problem. Second, a relaxed version of the optimization problem is solved via the alternating direction method of multipliers. Finally, the performance of our approach is validated through numerical simulations of realistic scenarios using a standard IEEE benchmark feeder.

bus clustering↗
NASA NTRSDate not supplied

Optimal Communication Topology Construction and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach with no estimation feedback to sensors selection and communication network topology computation for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes maximum airspace coverage with minimal resources, minimum communication time and power consumption while guaranteeing the system observability and providing in-time high quality information to both stationary and mobile users. The developed algorithms use multi-objective optimization strategy taking into account trade-offs between conflicting objectives and are implemented using off-the-shelf computational tools. The algorithms are validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace and parameters of a notional wireless communication network.

Distributed sensing↗
DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Hyperparameter Optimization in Binary Communication Networks for Neuromorphic Deployment

Training neural networks for neuromorphic deployment is non-trivial. There have been a variety of approaches proposed to adapt back-propagation or back-propagation-like algorithms appropriate for training. Considering that these networks often have very different performance characteristics than traditional neural networks, it is often unclear how to set either the network topology or the hyperparameters to achieve optimal performance. In this work, we introduce a Bayesian approach for optimizing the hyperparameters of an algorithm for training binary communication networks that can be deployed to neuromorphic hardware. We show that by optimizing the hyperparameters on this algorithm for each dataset, we can achieve improvements in accuracy over the previous state-of-the-art for this algorithm on each dataset (by up to 15 percent). This jump in performance continues to emphasize the potential when converting traditional neural networks to binary communication applicable to neuromorphic hardware.

Parsa, Maryam↗
DOE OSTI2024

How Does Escherichia coli Allocate Proteome?

Microorganisms are shown to actively partition their intracellular resources, such as pro- teins, for growth optimization. Recent experiments have begun to reveal molecular com- ponents unpinning the partition; however, it remains unclear quantitatively how individual parts orchestrate to yield precise resource allocation that is both robust and dynamic. Here we developed a coarse-grained mathematical framework that centers on guanosine pentaphosphate (ppGpp)-mediated regulation, and used it to systematically uncover the design principles of proteome allocation in Escherichia coli. Our results showed that cellular ability of resource partition lies in an ultrasensitive, negative feedback control- ling topology with the ultrasensitivity arising from zero-order amino acid kinetics and the negative feedback from ppGpp-controlled ribosome synthesis. In addition, together with the time-scale separation between slow ribosome kinetics and fast turnovers of ppGpp and amino acids, the network topology confers the organism an optimization mechanism which mimics sliding mode control, a nonlinear optimization strategy that is widely used in man-made systems. We further showed that such a controlling mechanism is robust against parameter variations and molecular fluctuations, and is also efficient for biomass production over time. Furthermore, this work elucidates the fundamental controlling mechanism of E. coli proteome allocation, thereby providing insights into quantitative microbial physiology as well as the design of synthetic gene networks.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Networked Microgrid Topology Reconfiguration to Promote Fairness in Proactive Load Shedding

Increasing occurrences of natural disasters and grid emergency events consistently challenge the safe and reliable operations of power systems. During such emergency situations, system operators may proactively shed load to mitigate risks. However, uncoordinated implementation of load shedding may disrupt electricity supply and even lead to cascading failures. Meanwhile, it is crucial to address potential biases affecting different customers when executing load shedding. This paper addresses the dynamic topology reconfiguration problem for networked microgrids with distributed energy resources under emergency conditions. Specifically, we propose a novel rolling-horizon optimization model that integrates fairness-aware constraints into the networked microgrid topology reconfiguration. Unlike existing approaches that focus solely on efficiency or apply fairness considerations in static settings, our method explicitly incorporates temporal fairness constraints to restrict repeated or excessive load curtailment for load blocks. Moreover, the fairness-aware constraints are specifically developed for the context of dynamic networked microgrid topology reconfiguration, and are designed to be convex or amenable to linear reformulations, which offers a more tractable alternative to traditional models with non-convex formulations. Numerical studies on a modified IEEE 13-bus system and a larger-sized SMART-DS networked microgrid system demonstrate the performance of the proposed algorithm towards more fairness-aware networked microgrid topology reconfiguration decision-making.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗
DOE OSTI2022

ASAP: Automatic Synthesis of Area-Efficient and Precision-Aware CGRAs

Coarse-grained reconfigurable accelerators (CGRAs) are a promising accelerator design choice that strikes a balance between performance and adaptability to different computing patterns across various applications domains. Designing a CGRA for a specific application domain involves enormous software/hardware engineering effort. Recent research works explore loop transformations, functional unit types, network topology, and memory size to identify optimal CGRA designs given a set of kernels from a specific application do- main. Unfortunately, the impact of functional units with different precision support has rarely been investigated. To address this gap, we propose ASAP – a hardware/software co-design framework that automatically identifies and synthesizes optimal precision-aware CGRA for a set of applications of interest. Our evaluation shows that ASAP generates specialized designs 3.2×, 4.21×, and 5.8× more efficient (in terms of performance per unit of energy or area) than non-specialized homogeneous CGRAs, for the scientific computing, embedded, and edge machine learning domains, respectively, with limited accuracy loss. Moreover, ASAP provides more efficient designs than other state-of-the-art synthesis frameworks for specialized CGRAs.

artificial intelligence↗
DOE OSTI2024

Cookie-Jar: An Adaptive Re-configurable Framework for Wireless Network Infrastructures

5G advancements like Massive Multiple Input Multiple Output (MIMO) bring high capacity and low latency, but also intensify interference challenges. Static and dynamic coordination techniques address this, often at the cost of increased power draw. We introduce Cookie-Jar (CJ), an interference coordination (IC) framework using reinforcement learning for multi-goal optimization. By dynamically adjusting network, power, and topology parameters based on real-time conditions, CJ improves Signal to Noise and Interference Ratio (SINR) while minimizing power consumption. Simulated 5G experiments showcase CJ's potential, achieving a 15% SINR improvement with near-identical power draw compared to existing methods.

Network↗
NASA NTRS1979

Telecommunications network optimization

Analysis discusses STACOM (state criminal justic communication) network topology program used to design and evaluate digital telecommunications networks STACOM employs ESAU-WILLIAMS technique to search for direct links between system terminations and regional switching center. Inputs include traffic data, terminal locations, and functional requirements.

Lee, J.↗
DOE OSTI2021

Evaluation of Topology Optimization to Achieve Energy Savings at the Urban District Level: Preprint

Advanced district thermal energy systems have the potential to achieve significant energy savings and facilitate the integration of renewable thermal resources and waste heat, contributing to reductions in carbon emissions. Such systems, also known as fifth generation district heating and cooling (5GDHC) systems, circulate water at temperatures close to ambient, and leverage electrically-driven water-source heat pumps located at connected buildings to further temper the water. However, barriers exist to the adoption of 5GDHC systems, including the factorial growth in potential network configurations as a function of the number of considered buildings. Topology optimization, which seeks to answer the questions, “Which is the best subset of buildings, if any, to connect to a district thermal energy system, and by what network should they be connected, to minimize life cycle cost?” can accelerate the adoption of 5GDHC systems. This study is part of an effort to develop a topology optimization framework for district thermal energy systems. In this study, a heuristic for one aspect of the topology optimization problem---the use of the minimal spanning tree network to connect a given set of buildings at the least life cycle cost---is validated.

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

Optimizing connectivity in reconfigurable networks

A method may include determining whether the topology of a network includes a direct path between a first endpoint and a second endpoint in the network. A direct path may be used to send a first type of traffic from the first endpoint to the second endpoint whereas any currently available path may be used to send a second type of traffic from the first endpoint to the second endpoint. If the topology of the network does not include a direct path, the first type of traffic may be buffered at the first endpoint until the topology of the network is reconfigured to include the direct path. The topology of the network may be reconfigured when at least one switch in the network reconfigures, for example, by switching from one interconnection to another interconnection pattern. Related systems and articles of manufacture are also provided.

Mellette, William↗
DOE OSTI2022

$\mathrm{IH}$-$\mathrm{GAN}$: A conditional generative model for implicit surface-based inverse design of cellular structures

Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically optimized structures, particularly those represented as discrete density maps. However, the optimization of such cellular structures is challenging due to the multiscale design problem. Past work addressing this problem generally either only optimizes the volume fraction of single-type unit cells but ignoring the effects of unit cell geometry on properties, or considers the geometry–property relation but builds this relation via heuristics. In contrast, we propose a simple yet more principled way to accurately model the property to geometry mapping using a conditional deep generative model, named Inverse Homogenization Generative Adversarial Network (IH-GAN). It learns the conditional distribution of unit cell geometries given properties and can realize the one-to-many mapping from properties to geometries. Here we further reduce the complexity of IH-GAN by using the implicit function parameterization to represent unit cell geometries. Results show that our method can 1) generate various unit cells that satisfy given material properties with high accuracy (R 2 -scores between target properties and properties of generated unit cells >98%) and 2) improve the optimized structural performance over the conventional variable-density single-type structure. In the minimum compliance example, our IH-GAN generated structure achieves a 79.7% reduction in concentrated stress and an extra 3.03% reduction in displacement. In the target deformation examples, our IH-GAN generated structure reduces the target matching error by 86.4% and 79.6% for two test cases, respectively. We also demonstrated that the connectivity issue for multi-type unit cells can be solved by transition layer blending.

42 ENGINEERING↗
NASA NTRS2008

Toward Optimal Transport Networks

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Alexandrov, Natalia↗
DOE OSTI2025

DISTRI: Distributed Multi-Facility HPC Simulator (DISTRI) v2.1

DISTRI is an advanced network simulator designed for multi-facility computational infrastructures with agentic behavior. It simulates HPC facilities where computational resources act as autonomous agents, making intelligent decisions about job scheduling, load balancing, and resource allocation. The simulator focuses on developing and testing decentralized algorithms that promote resilience and efficiency in multi-facility environments. Key Features: - Agentic Resource Behavior: Processors and DTNs act as autonomous agents with decision-making capabilities - Pheromone-Based Load Balancing: Decentralized load balancing inspired by ant colony optimization - Dual Topology Support: Mesh (normal operations) and Dumbell (network testing) topologies - Comprehensive TCP Simulation: Realistic TCP implementations with multiple congestion control algorithms - Failure Resilience Testing: Processor failure simulation with automatic job reassignment - Extensive Visualization: Detailed performance analysis and metrics collection - Research-Ready: Designed for algorithm development and benchmarking

Bez, Jean Luca [Lawrence Berkeley National Laborat↗