Search NASA⌕ Search

SEARCH · Search NASA

Results for “network flow analysis”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Analysis and Visualization of Discrete Fracture Networks Using a Flow Topology Graph

We present an analysis and visualization prototype using the concept of a flow topology graph (FTG) for characterization of flow in constrained networks, with a focus on discrete fracture networks (DFN), developed collaboratively by geoscientists and visualization scientists. Our method allows users to understand and evaluate flow and transport in DFN simulations by computing statistical distributions, segment paths of interest, and cluster particles based on their paths. The new approach enables domain scientists to evaluate the accuracy of the simulations, visualize features of interest, and compare multiple realizations over a specific domain of interest. Geoscientists can simulate complex transport phenomena modeling large sites for networks consisting of several thousand fractures without compromising the geometry of the network. However, few tools exist for performing higher-level analysis and visualization of simulated DFN data. The prototype system we present addresses this need. Here, we demonstrate its effectiveness for increasingly complex examples of DFNs, covering two distinct use cases - hydrocarbon extraction from unconventional resources and transport of dissolved contaminant from a spent nuclear fuel repository.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Extracting dependencies between network assets using deep learning

A network analysis tool receives network flow information and uses deep learning—machine learning that models high-level abstractions in the network flow information—to identify dependencies between network assets. Based on the identified dependencies, the network analysis tool can discover functional relationships between network assets. For example, a network analysis tool receives network flow information, identifies dependencies between multiple network assets based on evaluation of the network flow information, and outputs results of the identification of the dependencies. When evaluating the network flow information, the network analysis tool can pre-process the network flow information to produce input vectors, use deep learning to extract patterns in the input vectors, and then determine dependencies based on the extracted patterns. The network analysis tool can repeat this process so as to update an assessment of the dependencies between network assets on a near real-time basis.

Carroll, Thomas E.↗
DOE OSTI2016

Sample EP Flow Analysis of Severely Damaged Networks

These are slides for a presentation at the working group meeting of the WESC SREMP Software Product Integration Team on sample EP flow analysis of severely damaged networks. The following topics are covered: ERCOT EP Transmission Model; Zoomed in to Houston and Overlaying StreetAtlas; EMPACT Solve/Dispatch/Shedding Options; QACS BaseCase Power Flow Solution; 3 Substation Contingency; Gen. & Load/100 Optimal Dispatch; Dispatch Results; Shed Load for Low V; Network Damage Summary; Estimated Service Areas (Potential); Estimated Outage Areas (potential).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Simplified Pore Network Model for Analysis of Flow Capacity and Residual Oil Saturation Distribution Based on Computerized Tomography

The pore network (connected tunnels) can be used not only to describe pore geometry inside a rock but also to calculate various fluid flow properties on a micro scale. Based on a “digital core” extracted from micro computerized tomography (μ-CT), we have developed a simplified pore network model. This study simplifies the pore structure as a lattice of cubes. Pore size, pore distribution, tunnel connectivity, fluid viscosity, interfacial tension, and the external driving pressure gradient are considered for each adjacent cube to evaluate the flow capacity of the pore network. We calculated the permeability, effective permeability, and effective sweep efficiency. The results show that fluid flow initially starts in the largest tunnel, which corresponds to the threshold pressure of the rock sample (fluid flow onset pressure). Permeability changes nonlinearly before all the tunnels are involved in the flow. Changes in the microscopic residual oil saturation and the sweep efficiency were visualized based on the three-dimensional pore distribution. Visualization shows that more oil remains in the formation, the heterogeneity is greater, and the oil viscosity is higher.

58 GEOSCIENCES↗
DOE OSTI2019

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

An Analysis Framework for Distribution Network DER Integration Analysis in India: Distributed Solar in Tamil Nadu

This report is part of a two-part series that represents a year-long collaboration with the Tamil Nadu Generation and Distribution Corporation Limited (TANGEDCO) on power sector planning. The first report in this series, the Pathways for Tamil Nadu’s Electric Power Sector 2017-2030 report outlines NREL’s work with TANGEDCO's electricity sector planning department to develop a model of the State’s power system and evaluate multiple scenarios of system growth given resource constraints, costs of technologies, and power sector policies. This second report in this series focuses on the rapidly transforming distribution network in the State. The report outlines a framework developed by NREL with TANGEDCO's distribution utility to quickly and accurately analyze the impacts of integrating renewable energy, specifically rooftop solar PV onto Tamil Nadu's distribution system. Together these studies help to prepare Tamil Nadu for a rapidly transforming power system.

14 SOLAR ENERGY↗
DOE OSTI2017

Botnet behaviour analysis: How would a data analytics-based system with minimum a priori information perform?

Botnets, as one of the most aggressive threats, has used different techniques, topologies, and communication protocols in different stages of their lifecycle since 2003. Hence, identifying botnets has become very challenging specifically given that they can upgrade their methodology at any time. Various detection approaches have been proposed by the cyber-security researchers, focusing on different aspects of these threats. In this work, 5 different botnet detection approaches are investigated. These systems are selected based on the technique used and type of data used where 2 are public rule–based systems (BotHunter and Snort) and the other 3 use machine learning algorithm with different feature extraction methods (packet payload based and traffic flow based). On the other hand, 4 of these systems are based on a priori knowledge while one is using minimum a priori information. The objective here is to evaluate the effectiveness of these approaches under different scenarios (eg, multi-botnet and single-botnet classifications) as well as exploring how a system with minimum a priori information would perform. The goal is to investigate if a system with minimum a priori information could result in a competitive performance compared to systems using a priori knowledge. The evaluation is shown on 24 publicly available botnet data sets. Results indicate that a machine learning–based system with minimum a priori information not only achieves a very high performance but also generalizes much better than the other systems evaluated on a wide range of botnet structures (from centralized to decentralized botnets).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Flow Channeling in Fracture Networks: Characterizing the Effect of Density on Preferential Flow Path Formation

Flow channelization is a commonly observed phenomenon in fractured subsurface media where the flow of fluids is restricted primarily to highly transmissive fracture networks surrounded by a low-permeability rock matrix. The multiscale structural heterogeneity of these networks results in multiscale flow channelization where preferential flow paths form at length scales ranging from the entire system down to the subfracture size. We present an analysis of how one of the largest scales in fractured media, the network density, influences the degree of flow channeling that occurs using an ensemble of semigeneric three-dimensional discrete fracture network (DFN) simulations. We construct 10 DFNs, whose fracture lengths follow a power law distribution, at four densities for a total of 40 networks. We characterize their structure in terms of the network topology and geometry. Eulerian and Lagrangian observations of the steady-state flow fields obtained within the networks are used to quantify the degree of flow channelization at the network scale. We introduce a measure for the importance-ranking/hierarchy of different flow paths in the network using graph-based analysis of Lagrangian transport by which the degree of flow channeling between networks is compared. These flow observations are then linked to the structural properties of the networks. In general, network-scale flow channeling decreases as the network density increases. However, at low densities, there is more uniform flow within the entire connected network than in high-density networks. We also demonstrate how standard transport observables can be used to infer the degree of flow channelization occurring within a fracture network.

58 GEOSCIENCES↗
DOE OSTI2020

Complementary workflows for identifying one-hop network behavior and multi-hop network dependencies

A network analysis tool evaluates network flow information in complementary workflows to identify one-hop behavior of network assets and also identify multi-hop dependencies between network assets. In one workflow (e.g., using association rule learning), the network analysis tool can identify significant one-hop communication patterns to and/or from network assets, taken individually. Based on the identified one-hop behavior, the network analysis tool can discover patterns of similar communication among different network assets, which can inform decisions about deploying patch sets, mitigating damage, configuring a system, or detecting anomalous behavior. In a different workflow (e.g., using deep learning or cross-correlation analysis), the network analysis tool can identify significant multi-hop communication patterns that involve network assets in combination. Based on the identified multi-hop dependencies, the network analysis tool can discover functional relationships between network assets, which can inform decisions about configuring a system, managing critical network assets, or protecting critical network assets.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Modeling Data Flows with Network Calculus in Cyber-Physical Systems: Enabling Feature Analysis for Anomaly Detection Applications

The electric grid is becoming increasingly cyber-physical with the addition of smart technologies, new communication interfaces, and automated grid-support functions. Because of this, it is no longer sufficient to only study the physical system dynamics, but the cyber system must also be monitored as well to examine cyber-physical interactions and effects on the overall system. To address this gap for both operational and security needs, cyber-physical situational awareness is needed to monitor the system to detect any faults or malicious activity. Techniques and models to understand the physical system (the power system operation) exist, but methods to study the cyber system are needed, which can assist in understanding how the network traffic and changes to network conditions affect applications such as data analysis, intrusion detection systems (IDS), and anomaly detection. In this paper, we examine and develop models of data flows in communication networks of cyber-physical systems (CPSs) and explore how network calculus can be utilized to develop those models for CPSs, with a focus on anomaly and intrusion detection. This provides a foundation for methods to examine how changes to behavior in the CPS can be modeled and for investigating cyber effects in CPSs in anomaly detection applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Estimation of Commodity Origin-Destination Matrices and Flows: The Network Tomography of U.S. Wheat Shipments

This study proceeds from the belief that an examination of railroads and railcar flows provides important insights into economic geography and to the economics of transportation. The flows of wheat in the United States are examined using rail carload waybill survey data in order to model the network routes likely taken from origin to destination, a characterization of the flows themselves, and modeling the flows through the comparison of standard gravity models with two relatively new gravity estimation methodologies suggested in the network analysis literature. The analysis covers Wheat flows through the U.S. for the years 2013 through 2015. Rail flows are highly conducive to the emergence of high volume corridors, a primary hypothetical relationship described by Taaffe, Morrill and Gould (1963). Hubs are expected to develop in market centers with sufficient traffic, as in a Christaller (1966) system, where market centers above a certain size have terminal facilities, or serve as primary interchange points. Centers of different sizes may also have more than one load center thereby concentrating and attracting more flows (o’Kelly, 1998). Implications are for commodity production and processing locations to develop concentrations of flows and the development of identifiable commodity-specific components of the national rail network. As the railroad nodes are structured in relation to the railroad network, the origin and destination nodes take the form of an irregular lattice (Besag 1974). One implication of this irregular lattice network is the probable presence of network autocorrelation in the flows: the constraints of network connectivity assure flows are not open between the terminals, but travel to and from distinct neighbors on the network. In addition, the network terminal structure can be expected to follow a hierarchical central place ordering. Evidence of such an ordering may be determined by examining the clustering and concentration of flows at nodes and, by association, particular network links serving those nodes (Fujita and Thisse 2002; Hesse and Rodrigue 2004; Nierat 1997). The presence of hierarchies implies economies of scale are being realized which leads to a centralizing or agglomerating effect (Fujita and Thisse, 2002 and Brakman et al, 2001). Thus the transportation sector will also develop an associated central place hierarchy with its own associated network of flows and flow concentrations.

Peterson, Steven↗
DOE OSTI2025

Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. Here, this letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

42 ENGINEERING↗
DOE OSTI2022

GradientGraph

Under this SBIR Phase II, Reservoir Labs has developed G2 Analytics, a new technology that allows network operators to analyze bottleneck and flow performance with high precision. G2 delivers a new analytical approach and framework to resolve a variety of key problems found in modern communication networks, including: traffic engineering, routing, flow scheduling, network design, capacity planning, resiliency analysis, network slicing, or service level agreement (SLA) management, among others. G2 leverages the bottleneck structure of congestion-controlled communication networks, a recent mathematical discovery by the Reservoir team [RL19b, RL20a, RL20b, RL21a]. Bottleneck structures reveal how perturbations on flows and links propagate through the network, providing an analytical framework to measure (qualitatively and quantitatively) the ripple effects induced as they traverse the network. Leveraging the mathematics of bottleneck structures, Reservoir Labs is developing the G2 technology to provide network operators with a framework to design, optimize and troubleshoot network performance. This delivery includes the G2 software stack.

Yellamraju, Sruthi↗
DOE OSTI2023

Assignment of Freight Traffic in a Large-scale Intermodal Network under Uncertainty

This paper presents a methodology for freight traffic assignment in a large-scale road-rail intermodal network under uncertainty. Network uncertainties caused by natural disasters have dramatically increased in recent years. Several of these disasters (e.g., Hurricane Sandy, Mississippi River Flooding, and Hurricane Harvey) severely disrupted the U.S. freight transportation network, and consequently, the supply chain. To account for these network uncertainties, a stochastic freight traffic assignment model is formulated. An algorithmic framework, involving the sample average approximation and gradient projection algorithm, is proposed to solve this challenging problem. The developed methodology is tested on the U.S. intermodal network with freight flow data from the Freight Analysis Framework. The experiments consider three types of natural disasters that have different risks and impacts on transportation networks: earthquakes, hurricanes, and floods. It is found that for all disaster scenarios, freight ton-miles are higher compared to the base case without uncertainty. The increase in freight ton-miles is the highest under the flooding scenario; this is because there are more states in the flood-risk areas, and they are scattered throughout the U.S.

42 ENGINEERING↗