LiveMap: A Multi-Domain Network Flow Visualization and Analysis Tool
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
A communication system includes a first quantum key distribution device and an intermediary device. The first quantum key distribution device is configured to be coupled to a second quantum key distribution device over a quantum channel and to generate a shared key with the second quantum key distribution device based on a quantum state transmitted along the quantum channel. The intermediary device is disposed along a communication pathway within a network between a sender device and a receiver device. The intermediary device is communicatively connected to the first quantum key distribution device and configured to utilize the shared key to authenticate one or more data packets communicated from the sender device along the communication pathway by examining the one or more data packets for a presence of an information pattern that is associated with the shared key.
One area of intense scientific interest for the study of sandstones, carbonates, and shale at the pore scale is the use of limited image and petrophysical data to generate multiple realizations of a rock’s pore structure. Such images aid efforts to quantify uncertainty in petrophysical properties, including porosity–permeability transforms. We develop and evaluate a deep learning-based method to synthesize porous media volumes using a so-called generative flow model trained on x-ray microscope images of rock texture and pore structure. These models are optimized on a log-likelihood objective and they synthesize large and realistic three-dimensional images. Further, we demonstrate the rapid generation of sandstone image volumes that display realism as gauged by quantitative comparison of topological features using Minkowski functionals of porosity, specific surface area, and the Euler–Poincaré characteristic (i.e., pore connectivity). We also evaluate the single-phase permeability using Navier–Stokes and lattice Boltzmann methods and show that transport properties of the generated samples match measured trends.
Explore the source record for details and available documents.
Network FLOW analyzER - Network bi-directional deep packet header inspection. This software is designed to generate custom network flow records by monitoring bi-directional traffic from a span port, tap or other source. This function is independent of proprietary hardware or software solutions. This tool solves the problem of existing COTS solutions being either too complex or too slow.
Techniques based on the Theory of Bottleneck Ordering can reveal the bottleneck structure of a network, and the Theory of Flow ordering can take advantage of the revealed bottleneck structure to manage and configure network flows so as to improve the overall network performance. These two techniques provide insights into the inherent topological properties of a network at least in three areas: (1) identification of the regions of influence of each bottleneck; (2) the order in which bottlenecks (and flows traversing them) may converge to their steady state transmission rates in distributed congestion control algorithms; and (3) the design of optimized traffic engineering policies.
Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.
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.
Part I of this report focused on the acquisition and presentation of transient PVT data sets that can be used to validate gas transfer models. Here in Part II we focus primarily on describing models and validating these models using the data sets. Our models are intended to describe the high speed transport of compressible gases in arbitrary arrangements of vessels, tubing, valving and flow branches. Our models fall into three categories: (1) network flow models in which flow paths are modeled as one-dimensional flow and vessels are modeled as single control volumes, (2) CFD (Computational Fluid Dynamics) models in which flow in and between vessels is modeled in three dimensions and (3) coupled network/CFD models in which vessels are modeled using CFD and flows between vessels are modeled using a network flow code. In our work we utilized NETFLOW as our network flow code and FUEGO for our CFD code. Since network flow models lack three-dimensional resolution, correlations for heat transfer and tube frictional pressure drop are required to resolve important physics not being captured by the model. Here we describe how vessel heat transfer correlations were improved using the data and present direct model-data comparisons for all tests documented in Part I. Our results show that our network flow models have been substantially improved. The CFD modeling presented here describes the complex nature of vessel heat transfer and for the first time demonstrates that flow and heat transfer in vessels can be modeled directly without the need for correlations.
The steady-state solution of fluid flow in pipeline infrastructure networks driven by junction/node potentials is a crucial ingredient in various decision-support tools for system design and operation. While the nonlinear system is known to have a unique solution (when one exists), the absence of a definite result on the existence of solutions hobbles the development of computational algorithms, for it is not possible to distinguish between algorithm failure and non-existence of a solution. In this letter, we show that for any fluid whose equation of state is a scaled monomial, a unique solution exists for such nonlinear systems if the term solution is interpreted in terms of potentials and flows rather than pressures and flows. However, for gases following the CNGA equation of state, while the question of existence remains open, we construct an alternative system that always has a unique solution and show that the solution to this system is a good approximant of the true solution. Further, the existence result for flow of natural gas in networks also applies to other fluid flow networks such as water distribution networks or networks that transport carbon dioxide in carbon capture and sequestration. Most importantly, our result enables correct diagnosis of algorithmic failure, problem stiffness, and non-convergence in computational algorithms.
Resilient intermodal freight networks are vital for sustaining supply chains amid increasing threats from natural hazards and cyberattacks. Transportation resilience has been widely studied; understanding how random and targeted disruptions affect structural connectivity and functional performance remains a key challenge. To address this, this study evaluates the robustness of the US intermodal freight network, which consists of rail and water modes, using a simulation-based framework that integrates graph-theoretic metrics with flow-weighted centrality measures. Disruption scenarios are examined, including random failures as well as targeted node and edge removals based on static and dynamically updated degree and betweenness centrality. To reflect more realistic conditions, flow-weighted degree centralities (WDC) and partial node degradation are considered. Two resilience indicators are used: (1) the size of the giant connected component to measure structural connectivity; and (2) flow-weighted network efficiency (NE) to assess freight mobility under disruption. The results show that progressively degrading nodes ranked by WDC to 60% of their original functionality causes a sharper decline in normalized NE, for up to approximately 45 affected nodes, than complete failure (100% loss of functionality) applied to nodes targeted by weighted betweenness centrality or selected at random. This highlights how partial degradation of high-tonnage hubs can produce disproportionately large functional losses. The findings emphasize the need for resilience strategies that go beyond network topology to incorporate freight flow dynamics.
Key challenges associated with the EGS reservoir development include the ability to reliably predict hydraulic fracturing and the deformation of natural fractures as well as estimating permeability evolution of the fracture network with time. We have developed a physics-based rock deformation and fracture propagation simulator by coupling a discrete element model (DEM) for fracturing with a network flow model. In DEM model, solid rock is represented by a network of discrete elements (often referred as particles) connected by various types of mechanical bonds such as springs, elastic beams or bonds that have more complex properties (such as stress-dependent elastic constants). Fracturing is represented explicitly as broken bonds (microcracks), which form and coalesce into macroscopic fractures when external and internal load is applied. The natural fractures are represented by a series of connected line segments. Mechanical bonds that intersect with such line segments are removed from the DEM model. A network flow model using conjugate lattice to the DEM network is developed and coupled with the DEM. The fluid pressure gradient exerts forces on individual elements of the DEM network, which therefore deforms the mechanical bonds and breaks them if the deformation reaches a prescribed threshold value. Such deformation/fracturing in turn changes the permeability of the flow network, which again changes the evolution of fluid pressure, intimately coupling the two processes. The intimate coupling between fracturing/deformation of fracture networks and fluid flow makes the meso-scale DEM- network flow simulations necessary in order to accurately evaluate the permeability evolution, as these methods have substantial advantages over conventional continuum mechanical models of elastic rock deformation. The challenges that must be overcome to simulate EGS reservoir stimulation, preliminary results, progress to date and near future research directions and opportunities will be discussed. Methodology for coupling the DEM model with continuum flow and heat transport models will also be discussed.
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 a top flow detection likelihood computed for a cache of flows identified in the arriving network traffic. After observing packets sampled from the network, Dirichlet-Categorical inference is employed to calculate a posterior distribution that captures uncertainty about the sizes of each flow, yielding a top flow detection likelihood. The posterior distribution is used to find the most likely subset of elephant flows. The technique rapidly converges to the optimal sampling rate at a speed O(1/n), where n is the number of packet samples received, and the only hyperparameter required is the targeted detection likelihood.
Building systems and their heating, ventilation and air conditioning flow networks, are becoming increasingly complex. Some building energy simulation tools simulate these flow networks using pressure drop equations. These flow network models typically generate coupled algebraic nonlinear systems of equations, which become increasingly more difficult to solve as their sizes increase. This leads to longer computation times and can cause the solver to fail. These problems also arise when using the equation-based modelling language Modelica and Annex 60-based libraries. This may limit the applicability of the library to relatively small problems unless problems are restructured. This paper discusses two algebraic loop types and presents an approach that decouples algebraic loops into smaller parts, or removes them completely. The approach is applied to a case study model where an algebraic loop of 86 iteration variables is decoupled into smaller parts with a maximum of five iteration variables.
Abstract The macroscopic fundamental diagram (MFD) captures an orderly relationship among traffic flow, density, and speed at the network level. It is a simple yet powerful tool for modeling traffic dynamics in large urban networks with broad application in traffic control and management. However, empirically derived MFDs in urban regions require high-resolution traffic data from the network. Having the network flow and vehicular density estimated at the (granular) census tract level using vehicle probe data, we apply machine learning methods to predict the MFDs across U.S. urban areas and capture the impacts of location-specific input features on the network flow–density relationships at a large scale. The results show that, among the four tested machine learning approaches (Random Forest, XGBoost, Support Vector Machine, and Neural Network), XGBoost delivers the best performance in predicting network traffic flow based on vehicular density and location attributes. Using interaction Shapley Additive explanation (SHAP) values and partial correlation analysis, we examine the factors influencing MFD shapes across different locations. Our empirical findings reveal that across U.S. urban areas, network topology, transportation infrastructure, and land use are primary factors shaping MFD curves, while demand and trip-related factors play a lesser role. Specifically, higher ranking roads, centrality, and development levels correlate positively with network capacity and critical density, whereas negative associations are observed for network connectivity, mixed-use development, and road roughness levels.