Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network topologies”

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 703 records · Page 39

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids: Preprint

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve more than 10-fold improvement in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves the OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve an improvement of more than tenfold in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multilevel Monte Carlo Predictions of First Passage Times in Three-Dimensional Discrete Fracture Networks: A Graph-Based Approach

In this paper, we present a method combining multilevel Monte Carlo (MLMC) and a graph-based primary subnetwork identification algorithm to provide estimates of the mean and variance of the distribution of first passage times in fracture media at significantly lower computational cost than standard Monte Carlo (MC) methods. Simulations of solute transport are performed using a discrete fracture network (DFN), and instead of using various grid resolutions for levels in the MLMC, which is standard practice in MLMC, we identify a hierarchy of subnetworks in the DFN based on the shortest topological paths through the network using a graph-based method. While the mean of these ensembles is of critical importance, the variance is also essential in fractured media where uncertainty is an overarching theme, and understanding variability across an ensemble is a requirement for safety assessments. The method provides good estimates of the mean and variance at two orders of magnitude lower computational cost than MC.

54 ENVIRONMENTAL SCIENCES↗

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↗

Systems level analysis of the Chlamydomonas reinhardtii metabolic network reveals variability in evolutionary co-conservation

Metabolic networks, which are mathematical representations of organismal metabolism, are reconstructed to provide computational platforms to guide metabolic engineering experiments and explore fundamental questions on metabolism. Systems level analyses, such as interrogation of phylogenetic relationships within the network, can provide further guidance on the modification of metabolic circuitries. Chlamydomonas reinhardtii , a biofuel relevant green alga that has retained key genes with plant, animal, and protist affinities, serves as an ideal model organism to investigate the interplay between gene function and phylogenetic affinities at multiple organizational levels. Here, using detailed topological and functional analyses, coupled with transcriptomics studies on a metabolic network that we have reconstructed for C. reinhardtii , we show that network connectivity has a significant concordance with the co-conservation of genes; however, a distinction between topological and functional relationships is observable within the network. Dynamic and static modes of co-conservation were defined and observed in a subset of gene-pairs across the network topologically. In contrast, genes with predicted synthetic interactions, or genes involved in coupled reactions, show significant enrichment for both shorter and longer phylogenetic distances. Based on our results, we propose that the metabolic network of C. reinhardtii is assembled with an architecture to minimize phylogenetic profile distances topologically, while it includes an expansion of such distances for functionally interacting genes. This arrangement may increase the robustness of C. reinhardtii 's network in dealing with varied environmental challenges that the species may face. As a result, the defined evolutionary constraints within the network, which identify important pairings of genes in metabolism, may offer guidance on synthetic biology approaches to optimize the production of desirable metabolites.

54 ENVIRONMENTAL SCIENCES↗

Communications and control for electric power systems

The first section of the report describes the AbNET system, a hardware and software communications system designed for distribution automation (it can also find application in substation monitoring and control). The topology of the power system fixes the topology of the communications network, which can therefore be expected to include a larger number of branch points, tap points, and interconnections. These features make this communications network unlike any other. The network operating software has to solve the problem of communicating to all the nodes of a very complex network in as reliable a way as possible even if the network is damaged, and it has to do so with minimum transmission delays and at minimum cost. The design of the operating protocols is described within the framework of the seven-layer Open System Interconnection hierarchy of the International Standards Organization. Section 2 of the report describes the development and testing of a high voltage sensor based on an electro-optic polymer. The theory of operation is reviewed. Bulk fabrication of the polymer is discussed, as well as results of testing of the electro-optic coefficient of the material. Fabrication of a complete prototype sensor suitable for use in the range 1-20 kV is described. The electro-optic polymer is shown to be an important material for fiber optic sensing applications. Appendix A is theoretical support for this work. The third section of the report presents the application of an artificial neural network, Kohonen's self-organizing feature map, for the classification of power system states. This classifier maps vectors of an N-dimensional space to a 2-dimensional neural net in a nonlinear way preserving the topological order of the input vectors. These mappings are studied using a nonlinear power system model.

Kirkham, H.↗

Pathway structure determination in complex stochastic networks with non-exponential dwell times

Analysis of complex networks has been widely used as a powerful tool for investigating various physical, chemical, and biological processes. To understand the emergent properties of these complex systems, one of the most basic issues is to determine the structure and topology of the underlying networks. Recently, a new theoretical approach based on first-passage analysis has been developed for investigating the relationship between structure and dynamic properties for network systems with exponential dwell time distributions. However, many real phenomena involve transitions with non-exponential waiting times. We extend the first-passage method to uncover the structure of distinct pathways in complex networks with non-exponential dwell time distributions. It is found that the analysis of early time dynamics provides explicit information on the length of the pathways associated to their dynamic properties. It reveals a universal relationship that we have condensed in one general equation, which relates the number of intermediate states on the shortest path to the early time behavior of the first-passage distributions. Our theoretical predictions are confirmed by extensive Monte Carlo simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Superfluid-like turbulence in cosmology

A network of vortices in a superfluid system exhibits turbulent behavior. It is argued that the universe may have experienced such a phase of superfluid-like turbulence due to the existence of a coherent state with non-topological charge and a network of global strings. The unique feature of a distribution of turbulent domains is that it can yield non-gravitationally induced large-scale coherent velocities. It may be difficult, however, to relate these velocities to the observed large-scale bulk motion.

Gradwohl, Ben-Ami↗

Multilevel Method for Modeling Large-Scale Networks

Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from researchers. We propose to develop multilevel methods to model complex networks. The key point of the proposed strategy is that it will help to preserve part of the unknown structural attributes by guaranteeing the similar behavior of the real and artificial model on different scales.

99 GENERAL AND MISCELLANEOUS↗

An Evaluation of the Network Simulators in Large-Scale Distributed Simulations

This is a survey paper about the state-of-the-art in large-scale network simulation. Networks for the smart grids are characterized by millions of sensor nodes exchanging information about the status of the grid. This information exchange must be realized reliably and efficiently due to the mission critical nature of the power grid. Hence, the applications and the network protocols developed for the smart grid need go through rigorous testing and analysis before deployment. Developers usually do not have access to such a large-scale network that can be used as a controlled test-bed; therefore, network simulation becomes an essential tool for testing. Network simulation is a well studied problem in the literature and there are various widely used network simulators. These simulators can be adopted for testing applications and protocols of the smart grid. Due to the scale of these networks, parallel/distributed simulations need to be conducted. Even though most network simulators support distributed simulations, generating a large-scale network model to simulate can still be a cumbersome task. In this survey, we describe a selection of commonly used network simulators and evaluate them with respect to the following features that can aid users in distributed simulations of large-scale networks: transparency of setting up distributed simulation, automated topology generation, information hiding, lightweight routing protocols, network error simulation, evaluation of the network model during simulation and trace analysis tools. As a complementary result, we identify two issues with network simulators that can be addressed with runtime steering methods.

99 GENERAL AND MISCELLANEOUS↗

Three-state majority-vote model on small-world networks

Abstract In this work, we study the opinion dynamics of the three-state majority-vote model on small-world networks of social interactions. In the majority-vote dynamics, an individual adopts the opinion of the majority of its neighbors with probability 1- q , and a different opinion with chance q , where q stands for the noise parameter. The noise q acts as a social temperature, inducing dissent among individual opinions. With probability p , we rewire the connections of the two-dimensional square lattice network, allowing long-range interactions in the society, thus yielding the small-world property present in many different real-world systems. We investigate the degree distribution, average clustering coefficient and average shortest path length to characterize the topology of the rewired networks of social interactions. By employing Monte Carlo simulations, we investigate the second-order phase transition of the three-state majority-vote dynamics, and obtain the critical noise $$q_c$$ q c , as well as the standard critical exponents $$\beta /\nu$$ β / ν , $$\gamma /\nu$$ γ / ν , and $$1/\nu$$ 1 / ν for several values of the rewiring probability p . We conclude that the rewiring of the lattice enhances the social order in the system and drives the model to different universality classes from that of the three-state majority-vote model in two-dimensional square lattices.

99 GENERAL AND MISCELLANEOUS↗

Identifying Vulnerabilities and Hardening Attack Graphs for Networked Systems

We investigate efficient security control methods for protecting against vulnerabilities in networked systems. A large number of interdependent vulnerabilities typically exist in the computing nodes of a cyber-system; as vulnerabilities get exploited, starting from low level ones, they open up the doors to more critical vulnerabilities. These cannot be understood just by a topological analysis of the network, and we use the attack graph abstraction of Dewri et al. to study these problems. In contrast to earlier approaches based on heuristics and evolutionary algorithms, we study rigorous methods for quantifying the inherent vulnerability and hardening cost for the system. We develop algorithms with provable approximation guarantees, and evaluate them for real and synthetic attack graphs.

attack graphs↗

The Influence of Topology Changes on Inter-area Oscillation Modes and Mode Shapes

The topology of a power grid network is a piece of critical information for power grid operations. Different power grid topologies can change grid characteristics, inter-area oscillation modes, mode shapes, and even the robustness of the power system. This paper presents some preliminary study results, based on an approved WECC operating case and a modified low damping WECC system, to show the impact of topology changes resulting from N-1 contingencies on power system modes and mode shapes. The results show that topology changes can have very different impact on modal properties in a power system: some result in unstable situation, while others can improve small signal stability. For the former, the studies show about 4.5% damping reduction, so 5% damping margin would be required to ensure the system can sustain the contingencies. For the latter, those topology changes could be used as a control method to improve small signal stability. Mode shapes normally do not change when there is an N-1 topology change. These observations suggest that the inclusion of topological information is useful for improving the accuracy and effectiveness of power system control schemes.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hyperspectral Image Classification using a Self-Organizing Map

The use of hyperspectral data to determine the abundance of constituents in a certain portion of the Earth's surface relies on the capability of imaging spectrometers to provide a large amount of information at each pixel of a certain scene. Today, hyperspectral imaging sensors are capable of generating unprecedented volumes of radiometric data. The Airborne Visible/Infrared Imaging Spectrometer (AVIRIS), for example, routinely produces image cubes with 224 spectral bands. This undoubtedly opens a wide range of new possibilities, but the analysis of such a massive amount of information is not an easy task. In fact, most of the existing algorithms devoted to analyzing multispectral images are not applicable in the hyperspectral domain, because of the size and high dimensionality of the images. The application of neural networks to perform unsupervised classification of hyperspectral data has been tested by several authors and also by us in some previous work. We have also focused on analyzing the intrinsic capability of neural networks to parallelize the whole hyperspectral unmixing process. The results shown in this work indicate that neural network models are able to find clusters of closely related hyperspectral signatures, and thus can be used as a powerful tool to achieve the desired classification. The present work discusses the possibility of using a Self Organizing neural network to perform unsupervised classification of hyperspectral images. In sections 3 and 4, the topology of the proposed neural network and the training algorithm are respectively described. Section 5 provides the results we have obtained after applying the proposed methodology to real hyperspectral data, described in section 2. Different parameters in the learning stage have been modified in order to obtain a detailed description of their influence on the final results. Finally, in section 6 we provide the conclusions at which we have arrived.

Martinez, P.↗