SEARCH · Engineering Papers
Results for “large networks”
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.
Systems and methods for detecting large network flows
In a system for efficiently detecting large/elephant flows in a network, the rate at which the received packets are sampled is adjusted according to the measured heavy tailedness of the arriving traffic, such that the measured heavy tailedness reaches a specified target level. The heavy tailedness is measured using the estimated sizes of different flows associated with the arriving packets. When the measured heavy tailedness reaches and remains at the specified target level, the flows having the largest estimated sizes are likely to be the largest/elephant flows in the network.
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.
Explicit integration with GPU acceleration for large kinetic networks
We demonstrate the first implementation of recently-developed fast explicit kinetic integration algorithms on modern graphics processing unit (GPU) accelerators. Taking as a generic test case a Type Ia supernova explosion with an extremely stiff thermonuclear network having 150 isotopic species and 1604 reactions coupled to hydrodynamics using operator splitting, we demonstrate the capability to solve of order 100 realistic kinetic networks in parallel in the same time that standard implicit methods can solve a single such network on a CPU. This orders-of-magnitude decrease in computation time for solving systems of realistic kinetic networks implies that important coupled, multiphysics problems in various scientific and technical fields that were intractable, or could be simulated only with highly schematic kinetic networks, are now computationally feasible.
Analyzing large biological datasets with association networks
Explore the source record for details and available documents.
A visual analytics system for optimizing the performance of large-scale networks in supercomputing systems
Not Available
Fast GPU-Based Generation of Large Graph Networks From Degree Distributions
Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.
Interference Moral Hazard in Large Multihop Networks
Cooperation between network nodes is critical for supporting services in ad hoc networks. Cooperation, however, is an idealized assumption that may not always be present. This assumption can fail because of moral hazard, a scenario in part caused by misaligned incentives between the requesting node and supporting node. In this paper, we characterize a moral hazard that perversely incentivizes nodes to increase their routing payments by transmitting interference into the multi-hop network. We refer to this as the interference moral hazard (IMH) problem which is inherent to strategyproof mechanisms with low overpayments. We investigate IMH as a non-cooperative game played by network nodes on a random graph. For large networks, we show that IMH can be solved in the network design space. Finally, we provide sufficient conditions on the network distribution that guarantee an equilibrium path with interference-free play. This is achieved by 1) lower-bounding the number of nodes and 2) bounding the network density slightly above the 2-connectedness threshold and below a proposed upper-bound. Simulations suggest that density plays a fundamental role in IMH.
Multi-Level Optimal Power Flow Solver in Large Distribution Networks
Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.
Multi-Level Optimal Power Flow Solver in Large Distribution Networks: Preprint
Solving optimal power flow (OPF) problem for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution networks of tree topology with deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multi-level implementation of the primal-dual gradient algorithm for solving the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verifies that the proposed algorithm can significantly improve computational speed without compromising any optimality.
DDStore: Distributed Data Store for Scalable Training of Graph Neural Networks on Large Atomistic Modeling Datasets
Graph neural networks (GNNs) are a class of Deep Learning models used in designing atomistic materials for effective screening of large chemical spaces. To ensure robust prediction, GNN models must be trained on large volumes of atomistic data on leadership class supercomputers. Even with the advent of modern architectures that consist of multiple storage layers that include node-local NVMe devices in addition to device memory for caching large datasets, extreme-scale model training faces I/O challenges at scale.We present DDStore, an in-memory distributed data store designed for GNN training on large-scale graph data. DDStore provides a hierarchical, distributed, data caching technique that combines data chunking, replication, low-latency random access, and high throughput communication. DDStore achieves near-linear scaling for training a GNN model using up to 1000 GPUs on the Summit and Perlmutter supercomputers, and reaches up to a 6.15x reduction in GNN training time compared to state-of-the-art methodologies.
Combining Flux Balance and Energy Balance Analysis for Large-Scale Metabolic Network: Biochemical Circuit Theory for Analysis of Large-Scale Metabolic Networks
Predicting behavior of large-scale biochemical metabolic networks represents one of the greatest challenges of bioinformatics and computational biology. Approaches, such as flux balance analysis (FBA), that account for the known stoichiometry of the reaction network while avoiding implementation of detailed reaction kinetics are perhaps the most promising tools for the analysis of large complex networks. As a step towards building a complete theory of biochemical circuit analysis, we introduce energy balance analysis (EBA), which compliments the FBA approach by introducing fundamental constraints based on the first and second laws of thermodynamics. Fluxes obtained with EBA are thermodynamically feasible and provide valuable insight into the activation and suppression of biochemical pathways.
Low-noise microwave receiving systems in a worldwide network of large antennas.
The Deep-Space Network (DSN) consists of a worldwide network of 26- and 64-m antennas spaced approximately 120 deg around the world. The DSN is a precision communications system designed to communicate with and control unmanned spacecraft traveling at interplanetary ranges. Recent developments in the performance and evaluation of the antennas and maser receivers are discussed, and developments which have contributed to radio-science projects, such as planetary radar astronomy, very-long-baseline interferometry, pulsar, and other astronomical observations are described. It is also shown how these radio-science measurements have been used to evaluate the performance of the antenna-receiver systems.
Synchronization of the DOE/NASA 100-kilowatt wind turbine generator with a large utility network
The DOE/NASA 100 kilowatt wind turbine generator system was synchronized with a large utility network. The system equipments and procedures associated with the synchronization process were described. Time history traces of typical synchronizations were presented indicating that power and current transients resulting from the synchronizing procedure are limited to acceptable magnitudes.
Distributed Outage Detection in Power Distribution Networks
Real time topology knowledge is essential for situational awareness of power distribution networks. Line outages change the topology of a distribution network. Hence, outage detection is an important task. Most of the existing outage detection algorithms are centralized, in which sensors communicate their data to a control center which performs outage detection using the received data. However, with the increasing size of the distribution network and with different areas of the network being monitored by different operators, communication is a bottleneck and scalability is a major concern. To address these issues, we propose a novel outage detection algorithm using a divide and conquer approach. First, we divide a distribution network into sub-networks, such that outage detection can be run in parallel in each sub-network independently ensuring scalability to large networks. Further, to reduce the latency, bandwidth and attenuation challenges associated with communications in a large network, we divide each sub-network into multiple control areas which communicate only with their neighbors. We employ a distributed iterative load estimation across the control areas of each sub-network and then use the load estimate for local outage detection in each control area. Here, the performance of our algorithm is evaluated for multiple feeder models and compared against traditional centralized outage detection algorithms.
Large-scale experimental validation of thermochemical water-splitting oxides discovered by defect graph neural networks
Thermochemical water-splitting (TCH) based on 2-step thermal redox cycles in metal oxides is a promising approach to generating H 2 , but state-of-the-art (SOTA) CeO 2 has several practical limitations, which has motivated continued materials discovery efforts in this field. Here, in this study, we improve upon a SOTA defect graph neural network (dGNN) surrogate model's oxygen vacancy predictions and combine them with materials project phase diagrams to down-select and discover structurally diverse, experimentally known metal oxides whose TCH performance was previously unknown. Amongst twelve candidates selected based on our high-throughput screening and down-selection criteria, we achieved ∼80% accuracy in identifying materials with stable redox cycling and hydrogen production in stagnation flow reactor water-splitting experiments. Closer to 100% accuracy can be achieved if higher-accuracy, hybrid DFT-predicted vacancy formation energies were computed and used in lieu of the most uncertain dGNN-based screening predictions, as they correct false positives to true negatives. Notably, two discovered candidates, Sr 3 PrMn 2 O 8 and Ba 2 Fe 2 O 5 , display hydrogen yields greater than CeO 2 under specific redox conditions. In conclusion, these results demonstrate our ability to computationally predict and experimentally validate promising candidate TCH materials that have the potential to compete with CeO 2 .
Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks
This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory environment, including the accurate modeling of a full-scale distribution system of 11,000 nodes, the DERMS software controller, and 90 power hardware photovoltaics (PVs) and battery inverters. The applied DERMS algorithm is designed based on a realtime optimal power flow algorithm and implemented with acceleration design that performs fast dispatch of simulated PVs and real physical hardware DER devices every 4 seconds.