Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Networking”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Reconfigurable Network Slicing Orchestration in Network Function Virtualization Compatible Operational Technology Environment

The ongoing transition to Industry 4.0, which is characterized by increased inter-connectivity of cyber-physical systems, requires having time-sensitive, high throughput, and secure transfer of critical data in industrial sites. In this context, network slicing emerges as a critical tool to ensure timely data delivery by provisioning the network resources to cater to specific applications’ requirements and mitigating potential cyber attacks. To address these challenges, this paper aims to tackle two key questions essential for the successful implementation of network slicing in industrial environments. First, it investigates architectural considerations for developing a network infrastructure capable of supporting network slicing functionalities effectively. The proposed approach significantly improves deployment efficiency over traditional manual configurations. Second, it delves into the automated orchestration process, elucidating the steps and components involved in transitioning from a static network management approach to dynamically leverage network function virtualization schemes for creating network slices in ad-hoc manner. The system demonstrates high throughput suitable for production-level solutions and maintains exceptionally low latency, making it ideal for ultra-reliable low-latency communications. Even with increased network demands, the system remains stable, with effective Quality of Service (QoS) management, ensuring reliable performance under varying conditions. The proposed architecture outlines the necessary components, services, and communication protocols required for a production-level orchestrator for network segmentation in SCADA environments.

Rodiles Delgado, Brian G.↗
DOE OSTI2025

Analyzing Infrastructure Interdependencies Using Network-Of-Networks Modeling

Infrastructure networks play a crucial role in our day-to-day lives, and modeling these infrastructure networks can help decisionmakers prepare for and respond to disruptions such as natural disasters or cyberattacks. Because these infrastructure networks depend on each other, it is not sufficient to model a single network in isolation. We build on previous single-network-modeling techniques to develop a methodology for modeling infrastructure interdependencies as a Network-of-Networks. Using distributionlevel data from a real U.S. city on the power grid, road geometry, and hospital locations, we show how to apply this methodology to modeling three of the U.S. Department of Homeland Security's Critical Infrastructure Sectors: Healthcare, Transportation, and Energy. We also analyze three primary metrics before and after a simulated disaster: 1) impact on hospital access; 2) road network impact with the change in betweenness centrality; 3) electric customer outage. We simulate three different disruptions: 1) road flooding from nearby rivers; 2) a malicious actor targeting the road networks; 3) a malicious actor targeting the electric grid. Finally, we discuss how our methodology can be applied to additional infrastructure networks and types of disruption, and how Artificial Intelligence (AI) techniques may be incorporated into this methodology for further research.

Scherrer, Evan [Drake University, Iowa]↗
DOE OSTI2023

New trends in photonic switching and optical networking architectures for data centers and computing systems [Invited]

The rapid increases in data traffic coupled with user preferences are driving the data center and computing system service providers to offer energy-efficient, intelligent, flexible, cost-effective, high-capacity, and low-latency data services without added complexity to the users. Disaggregated heterogeneous reconfigurable computing systems realized by photonic switching and interconnects can enhance throughput and energy efficiency for artificial intelligence/machine learning (AI/ML) workloads, especially when aided by the AI/ML-enhanced control plane. Photonic switching and new optical networking architectures are expected to solve many of these challenging problems. This paper discusses new trends in photonic switching and optical network architectures for future data centers and computing systems summarized as follows: (1) flat reconfigurable disaggregated computing enabled by high-radix photonic switching and interconnects in data centers; (2) chiplet-based computing architectures empowered by embedded photonics toward heterogeneous reconfigurable computing; (3) nanosecond-scale photonic switching in data centers and computing systems; (4) AI/ML in self-driving, application-aware, and situation-aware data centers; (5) the emergence of flexible networking for cloud computing, edge computing, and split computing, as well as flexible networking for 5G/6G RF-optical networks; and (6) the deployment of embedded co-designed silicon photonics being considered for future data centers.

Yoo, S. J. Ben (ORCID:0000000274201871)↗
DOE OSTI2017

Incentive-Based Voltage Regulation in Distribution Networks

This paper considers distribution networks fea- turing distributed energy resources, and designs incentive-based mechanisms that allow the network operator and end-customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Two different network-customer coordination mechanisms that require different amounts of information shared between the network operator and end-customers are developed to identify a solution of a well-defined social-welfare maximization prob- lem. Notably, the signals broadcast by the network operator assume the connotation of prices/incentives that induce the end- customers to adjust the generated/consumed powers in order to avoid the violation of the voltage constraints. Stability of the proposed schemes is analytically established and numerically corroborated.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

A generative graph model for electrical infrastructure networks

We propose a generative graph model for electrical infrastructure networks that accounts for heterogeneity in both node and edge type. To inform the design of this model, we analyze the properties of power grid graphs derived from the U.S. Eastern Interconnection, Texas Interconnection, and Poland transmission system power grids. Across these datasets, we find subgraphs induced by nodes of the same voltage level exhibit shared structural properties atypical to small-world networks, including low local clustering, large diameter and large average distance. On the other hand, we find subgraphs induced by transformer edges linking nodes of different voltage types contain a more limited structure, consisting mainly of small, disjoint star graphs. The goal of our proposed model is to match both these inter and intra-network properties by proceeding in two phases: we first generate subgraphs for each voltage level and then generate transformer edges that connect these subgraphs. The first phase of the model adapts the Chung-Lu random graph model, taking desired vertex degrees and desired diameter as inputs, while the second phase of the model is based on a simpler random star graph generation process. We test the performance of our model by comparing its output across many runs to the aforementioned real data. In nearly all categories tested, we find our model is more accurate in reproducing the unusual mixture of properties apparent in the data than the Chung-Lu model. We also include graph visualization comparisons, as well as a brief analysis of edge-deletion resiliency. Ultimately, our model may be used to generate synthetic graph data, test hypotheses and algorithms at different scales, and serve as a baseline model on top of which further electrical network properties, device models, and interdependencies to other networks, may be appended.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗
DOE OSTI2014

Implementability of two-qubit unitary operations over the butterfly network and the ladder network with free classical communication

We investigate distributed implementation of two-qubit unitary operations over two primitive networks, the butterfly network and the ladder network, as a first step to apply network coding for quantum computation. By classifying two-qubit unitary operations in terms of the Kraus-Cirac number, the number of non-zero parameters describing the global part of two-qubit unitary operations, we analyze which class of two-qubit unitary operations is implementable over these networks with free classical communication. For the butterfly network, we show that two classes of two-qubit unitary operations, which contain all Clifford, controlled-unitary and matchgate operations, are implementable over the network. For the ladder network, we show that two-qubit unitary operations are implementable over the network if and only if their Kraus-Cirac number do not exceed the number of the bridges of the ladder.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Charge transport network dynamics in molecular aggregates

Due to the nonperiodic nature of charge transport in disordered systems, generating insight into static charge transport networks, as well as analyzing the network dynamics, can be challenging. Here, we apply time-dependent network analysis to scrutinize the charge transport networks of two representative molecular semiconductors: a rigid n-type molecule, perylenediimide, and a flexible p-type molecule, bBDT(TDPP)2. Simulations reveal the relevant timescale for local transfer integral decorrelation to be ~100 fs, which is shown to be faster than that of a crystalline morphology of the same molecule. Using a simple graph metric, global network changes are observed over timescales competitive with charge carrier lifetimes. These insights demonstrate that static charge transport networks are qualitatively inadequate, whereas average networks often overestimate network connectivity. Finally, a simple methodology for tracking dynamic charge transport properties is proposed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2015

Impact of Network Activity Levels on the Performance of Passive Network Service Dependency Discovery

Network services often do not operate alone, but instead, depend on other services distributed throughout a network to correctly function. If a service fails, is disrupted, or degraded, it is likely to impair other services. The web of dependencies can be surprisingly complex---especially within a large enterprise network---and evolve with time. Acquiring, maintaining, and understanding dependency knowledge is critical for many network management and cyber defense activities. While automation can improve situation awareness for network operators and cyber practitioners, poor detection accuracy reduces their confidence and can complicate their roles. In this paper we rigorously study the effects of network activity levels on the detection accuracy of passive network-based service dependency discovery methods. The accuracy of all except for one method was inversely proportional to network activity levels. Our proposed cross correlation method was particularly robust to the influence of network activity. The proposed experimental treatment will further advance a more scientific evaluation of methods and provide the ability to determine their operational boundaries.

correlation↗
DOE OSTI2022

Network Anomaly Detection Using Federated Learning

The internet is turning out to be an integral part of every-one's lives as more and more devices are being connected to serve societal needs. Our work is motivated by two ma-jor observations. Firstly, one drawback of connecting to the network is the threat of network attacks that can compromise users' private information, leading to data loss and adversely affecting productivity. There are several traditional security mechanisms to defend against these attacks, such as firewalls, virtual private networks (VPNs), demilitarized zones (DMZs), and vulnerability scanners. One way to prevent these attacks is early detection and prevention. However, these kinds of architecture do not scale very well because of their centralized nature. Secondly, we observe from heuristics and data set distributions that the majority of the requests made to a server are innocuous. Therefore, almost all server request data sets are highly imbalanced, weighted highly towards the harmless requests.

Marfo, William↗
DOE OSTI2018

Aviation Transportation, Cyber Threats, and Network-of-Networks: Modeling Perspectives for Translating Theory to Practice

Understanding aviation transportation infrastructure system behavior and coupling with communication networks is essential for securing and restoring functionality against cyber-enabled threats. While significant progress has been made in the past decade on developing infrastructure resilience theories based on network structure and operations, translating and generalizing them to real-world practice has often been challenging due to imperfect data and inapplicability of modeling assumptions. These typically include: 1) stylized network structures without uncertainty, 2) node homogeneity, 3) static criticality measures, and 4) unrealistic cascade models originating from single points of failure. This paper presents modeling perspectives that aim to address these theory-to-practice challenges using a well-grounded network-of-networks (NoN) construct. Real-world modeling challenges are identified and a network theory-guided conceptual NoN model is developed that may be operationalized with the U.S. national airspace system airport network (NASAN) and Federal Aviation Administration (FAA) communication network as application domain. Improving accuracy in loss of functionality estimates due to cyber events in communication networks and cascading air travel delay impacts is key for informing consequence-based decision support and risk/contingency analyses.

Bhatia, Udit↗
DOE OSTI2022

Toward higher-radix switches with co-packaged optics for improved network locality in data center and HPC networks [Invited]

In this work, we study the network locality improvements that can be achieved by using co-packaged optics in data center and high-performance computing (HPC) networks. The increased escape bandwidth offered by co-packaged optics can enable switches with speeds of 51.2 Tb/s and beyond. From a network architecture perspective, the key advantages of introducing co-packaged optics at the switch points include the implementation of large-scale topologies of >12,000 end points with 4× higher bisection bandwidth and the reduction of the required number of switches by >40% compared with state-of-the-art approaches. From a network operation perspective, improved network locality and faster operation can be achieved since the higher-radix switches can mitigate the impact of network contention. Placing applications under fewer leaf switches reduces the number of packets that cross the spine switches in a leaf-spine topology. The proposed scheme is evaluated via discrete-event simulations: we initially evaluate the network locality properties of the system by using virtual-machine traces from a production data center, and we subsequently quantify the performance improvements by simulating an all-to-all pattern for a variety of message sizes over a number of nodes. The results suggest that co-packaged optics form a promising solution for keeping up with bandwidth scaling in future networks. The virtual-machine analysis shows that large-scale applications can be placed under up to 50% fewer first-level switches, while the network analysis shows speedups of up to 7.1, which translates to execution time reductions of up to 26% and 42.7% for applications with communication ratios of 0.3 and 0.5, respectively.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

The underground research facilities (URF) network - illustrating the IAEA's concept and use of professional networks - 15382

Since 2001, the IAEA has championed the concept and use of professional networks (Communities of Practice) to advance best practices and to provide a platform for cooperation in radioactive waste management, decommissioning and environmental remediation across the globe. The Underground Research Facilities (URF) Network was the first in a series of networks implemented under the auspices of the IAEA to share experiences, elicit best practices, and transfer knowledge on topics relevant to the development and implementation of geological disposal of long lived and high level radioactive waste - i.e. intermediate level waste (ILW), high-level waste (HLW) and/or spent nuclear fuel (SNF). Special emphasis is placed on the role and use of URFs to support such geological disposal developments. In addition to the direct benefits provided to Member States through its programme of work, the URF Network also delivers less tangible, yet equally valuable benefits through the informal exchange of information, the development of peer-to-peer professional networks, and seeding of multi-lateral cooperation between Member States. Network members represent a range of nuclear programme sizes and advancements in their respective repository programmes. After a decade of fruitful cooperation, delivering more than 30 training courses on topics relevant to geological disposal, the URF Network is gradually reassessing its mode of operation and focus of work. Emphasizing selected strategic goals - focused in part on more systematic training of URF Network members human resources and in part on select key technical issues - would benefit all network members, while remaining cautious in the commitment of scarce resources. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

Retracted Article: Distributed energy management for networked microgrids in a three-phase unbalanced distribution network

Owing to increased penetration of three-phase and single-phase microgrids, distributed energy resources (DERs), and responsive loads, the maintenance of a three-phase balance by distribution networks is a significant challenge. Existing literature on distributed energy management for networked microgrids generally neglects the distribution network or employs a simplified phase balanced distribution network; thus, these evaluations are not applicable. Further, the underlying mutual coupling between the different phases of distribution feeders results in a more challenging situation. Here, to solve this issue, this study sought to propose distributed energy management based on a three-phase unbalanced distribution network. Various three-phase or single-phase microgrids, utility-owned DERs, and responsive loads were coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) updated the schedules of the DERs and responsive loads under their jurisdiction separately. The price signals were then updated according to the generation-load mismatch at each node and distributed to the corresponding MCs and DMS for the next iteration. The iteration continued until a sufficiently small generation-load mismatch was achieved at all nodes, that is, a balanced generation and load at all nodes under the agreed price signals. Considering a three-phase unbalanced distribution network, the price signals were determined per phase per node. Overall, the proposed distributed energy management coordinates microgrids, utility-owned DERs, responsive loads with guaranteed network constraints, and preserves the privacy of microgrid customers. This distributed energy management method was further demonstrated through various case studies on a three-phase networked microgrid test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning generative neural networks with physics knowledge

Deep generative neural networks have enabled modeling complex distributions, but incorporating physics knowledge into the neural networks is still challenging and is at the core of current physics-based machine learning research. To this end, we propose a physics generative neural network (PhysGNN), a new class of generative neural networks for learning unknown distributions in a physical system described by partial differential equations (PDE). PhysGNN couples PDE systems with generative neural networks. It is a fully differentiable model that allows back-propagation of gradients through both numerical PDE solvers and generative neural networks, and is trained by minimizing the discrete Wasserstein distance between generated and observed probability distributions of the PDE outputs using the stochastic gradient descent method. Moreover, PhysGNN does not require adversarial training like standard generative neural networks, which offers better stability than adversarial training. We show that PhysGNN can learn complex distributions in stochastic inverse problems, where conventional methods such as maximum likelihood estimation and momentum matching methods may be inapplicable when little knowledge is known about the form of unknown distributions or the physical model is too complex. Furthermore, our method allows physics-based generative neural network training for learning complex distributions in the context of differential equations.

97 MATHEMATICS AND COMPUTING↗