Search NASA⌕ Search

SEARCH · Search NASA

Results for “network flow”

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 523 records · Page 29

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↗

Shape-shifting Elephants: Multi-modal Transport for Integrated Research Infrastructure

Data Acquisition (DAQ) workloads form an important class of scientific network traffic that by its nature (1) flows across different research infrastructure, including remote instruments and supercomputer clusters, (2) has ever-increasing throughput demands, and (3) has ever-increasing integration demands---for example, observations at one instrument could trigger a reconfiguration of another instrument. Today's DAQ transfers rely on UDP and (heavily tuned) TCP, but this is driven by convenience rather than suitability. The mismatch between Internet transport protocols and scientific workloads becomes more stark with the steady increase in link capacities, data generation, and integration across research infrastructure.This position paper argues the importance of developing specialized transport protocols for DAQ workloads. It proposes a new transport feature for this kind of elephant flow: multi-modality involves the network actively configuring the transport protocol to change how DAQ flows are processed across different underlying networks that connect scientific research infrastructure. Multi-modality is a layering violation that is proposed as a pragmatic technique for DAQ transport protocol design. It takes advantage of programmable network hardware that is increasingly being deployed in scientific research infrastructure. The paper presents an initial evaluation through a pilot study that includes a Tofino2 switch and Alveo FPGA cards, and using data from a particle detector.

97 MATHEMATICS AND COMPUTING↗

Network Jets as the Driver of Counter-streaming Flows in a Solar Filament

We investigate the driving mechanism of counter-streaming flows in a solar filament, using EUV images from SDO/AIA, line of sight magnetograms from SDO/HMI, IRIS SJ images, and H-alpha data from GONG. We find that: (i) persistent counter-streaming flows along adjacent threads of a small (100” long) solar filament is present; (ii) both ends of the solar filament are rooted at the edges of magnetic network flux lanes; (iii) recurrent small-scale jets (also known as network jets) occur at both ends of the filament; (iv) some of the network jets occur at the sites of flux cancelation between the majority-polarity flux and merging minority-polarity flux patches; (v) these multiple network jets clearly drive the counter-streaming flows along the adjacent threads of the solar filament for ~2 hours with an average speed of 70 km/s; (vi) some the network jets show base brightenings, analogous to the base brightenings of coronal jets; and (vii) the filament appears wider (4”) in EUV images than in H-alpha images (2.5”), consistent with previous studies. Thus, our observations show that counter-streaming flows in the filament are driven by network jets and possibly these driving network jet eruptions are triggered by flux cancelation.

Navdeep K Panesar↗

Long‐range quantum energy teleportation and distribution on a hyperbolic quantum network

Abstract Teleporting energy to remote locations is new challenge for quantum information science and technology. Developing a method for transferring local energy in laboratory systems to remote locations will enable non‐trivial energy flows in quantum networks. From the perspective of quantum information engineering, we propose a method for distributing local energy to a large number of remote nodes using hyperbolic geometry. Hyperbolic networks are suitable for energy allocation in large quantum networks since the number of nodes grows exponentially. To realise long‐range quantum energy teleportation (QET), we propose a hybrid method of quantum state telepotation and QET. By transmitting local quantum information through quantum teleportation and performing conditional operations on that information, QET can theoretically be realized independent of geographical distance. The method we present will provide new insights into new applications of future large‐scale quantum networks and potential applications of quantum physics to information engineering.

Ikeda, Kazuki↗

Supercritical, liquid, and gas CO 2 reactive transport and carbonate formation in portland cement mortar

In this paper, we investigate carbonate formation and reactive transport rate in variably saturated portland cement mortars when high concentrations of gas, liquid, or supercritical CO 2 flow through their pore network. Xray computed tomography completed during CO 2 flow is used to quantify the microstructural evolution as the mortar carbonates. After in situ tests, higher resolution scans, thermogravimetric analysis, and desorption isotherm analysis are performed to further quantify microstructural changes. We found that at dry conditions supercritical CO 2 moves more rapidly through the pore space and precipitates more carbonates than liquid or gas CO 2 . However, at 50% degree of saturation (DOS) the CO 2 state did not affect the rate of transport in that each specimen exposed to a different CO 2 state carbonated within the first hour of CO 2 exposure. When the pore space is at 50 or 100% DOS, supercritical CO 2 did not react with hydration products more rapidly nor did it result in more carbonate formation during exposure compared to gas or liquid CO 2 . The amount of Ca(OH) 2 that contributes to CaCO 3 formation is correlated to the DOS. For the mortar composition analyzed, Ca(OH) 2 contributes to approximately 40% of the carbonates formed in the 50% DOS specimens and 15% in the 100% DOS specimens. In other words, as the amount of moisture in the pore space increases, phases other than Ca(OH) 2 contribute to more than 50% of the total CaCO 3 formed.

42 ENGINEERING↗

A Scalable Compact Additively Manufactured Molten Salt to Supercritical Carbon Dioxide Heat Exchanger for Solar Thermal Application

Design of an additively manufactured molten salt (MS) to supercritical carbon dioxide (sCO 2 ) primary heat exchanger (PHE) for solar thermal power generation is presented. The PHE is designed to handle temperatures up to 720 °C on the MS side and an internal pressure of 200 bar on the sCO 2 side. In the core, MS flows through a three-dimensional periodic lattice network, while sCO 2 flows within pin arrays. The design includes integrated sCO 2 headers located within the MS flow, allowing for a counterflow design of the PHE. The sCO 2 headers are configured to enable uniform flow distribution into each sCO 2 plate while withstanding an internal pressure of 200 bar and minimizing obstruction to the flow of MS around it. The structural integrity of the design is verified on additively manufactured (AM) 316 stainless steel sub-scale specimens. An experimentally validated, correlation-based sectional PHE core thermofluidic model is developed to study the impact of flow and geometrical parameters on the PHE performance, with varied parameters including the mass flowrate, surface roughness, and PHE dimensions. A process-based cost model is used to determine the impact of parameter variation on build cost. The model results show that a heat exchanger with a power density of 18.6 MW/m 3 (including sCO 2 header volume) and effectiveness of 0.88 can be achieved at a heat capacity rate ratio of 0.8. As a result, the impact of design and AM machine parameters on the cost of the PHE are assessed.

14 SOLAR ENERGY↗

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires a networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗

An artificial neural network framework for reduced order modeling of transient flows

Here, this paper proposes a supervised machine learning framework for the non-intrusive model order reduction of unsteady fluid flows to provide accurate predictions of non-stationary state variables when the control parameter values vary. Our approach utilizes a training process from full-order scale direct numerical simulation data projected on proper orthogonal decomposition (POD) modes to achieve an artificial neural network (ANN) model with reduced memory requirements. This data-driven ANN framework allows for a nonlinear time evolution of the modal coefficients without performing a Galerkin projection. Our POD-ANN framework can thus be considered an equation-free approach for latent space dynamics evolution of nonlinear transient systems and can be applied to a wide range of physical and engineering applications. Within this framework we introduce two architectures, namely sequential network (SN) and residual network (RN), to train the trajectory of modal coefficients. We perform a systematic analysis of the performance of the proposed reduced order modeling approaches on prediction of a nonlinear wave-propagation problem governed by the viscous Burgers equation, a simplified prototype setting for transient flows. We find that the POD-ANN-RN yields stable and accurate results for test problems assessed both within inside and outside of the database range and performs significantly better than the standard intrusive Galerkin projection model. Finally, our results show that the proposed framework provides a non-intrusive alternative to the evolution of transient physics in a POD basis spanned space, and can be used as a robust predictive model order reduction tool for nonlinear dynamical systems.

42 ENGINEERING↗

Efficient Monte Carlo With Graph-Based Subsurface Flow and Transport Models

Simulating flow and transport in fractured porous media frequently involves solving numerical discretizations of partial differential equations with a large number of degrees of freedom using discrete fracture network (DFN) models. Uncertainty in the properties of the fracture network that controls flow and transport requires a large number of DFN simulations to statistically describe quantities of interest. However, the computational cost of solving more than a few realizations of a large DFN can be intractable. As a means of circumventing this problem, we utilize both a high-fidelity DFN model and a graphbased model of flow and transport in combination with a multifidelity Monte Carlo (MC) method to reduce the number of high-fidelity simulations that are needed to obtain an accurate estimate of the quantity of interest. We demonstrate the approach by estimating quantiles of the breakthrough time for a conservative tracer in an ensemble of fractured porous media. Our results demonstrate that a multifidelity MC estimate, whose computational cost is equal to the cost of 10 DFN simulations, can be as accurate as a standard MC estimate that utilizes 1,000 DFN simulations. Thus the combination of our graphbased model with multifidelity MC estimates effectively reduces the computational cost of the problem by a factor of approximately 100.

58 GEOSCIENCES↗

Predicting CO 2 Plume Migration in Heterogeneous Formations Using Conditional Deep Convolutional Generative Adversarial Network

Numerical simulation of flow and transport in heterogeneous formations has long been studied, especially for uncertainty quantification and risk assessment. The high computational cost associated with running large-scale numerical simulations in a Monte Carlo sense has motivated the development of surrogate models, which aim to capture the important input-output relations of physics-based models but require only a fraction of the cost of full model runs. In this work, we formulate a conditional deep convolutional generative adversarial network (cDC-GAN) surrogate model to learn the dynamic functional mappings in multiphase models. The cDC-GAN belongs to a class of semisupervised learning methods that can be used to learn the data generation processes. Like the original GAN, a main strength of the cDC-GAN is that it includes a self-training scheme for improving the quality of generative modeling in a game theoretic framework, without requiring extensive statistical knowledge and assumptions on input data distributions. In particular, our cDC-GAN model is designed to learn cross-domain mappings between high-dimensional input (e.g., permeability) and output (e.g., phase saturations) pairs, with the ability to incorporate conditioning information (e.g., prediction time). As a use case, we demonstrate the performance of cDC-GAN for predicting the migration of carbon dioxide (CO 2 ) plume in heterogeneous carbon storage reservoirs, which has both numerical and practical significance because of the safe storage requirements now mandated in many countries. Results show that cDC-GAN achieves high accuracy in predicting the spatial and temporal evolution patterns of the injected CO 2 plume, as compared to the original results obtained using a compositional reservoir simulator. The performance of cDC-GAN models, trained using the same number of training samples, stays relatively robust when the level of spatial heterogeneity is increased. Our cDC-GAN is pattern based and is not limited by the underlying physics. Thus, it provides a general framework for developing surrogate models, and for conducting uncertainty analyses for a wide range of physics-based models used in both groundwater and subsurface energy exploration applications.

54 ENVIRONMENTAL SCIENCES↗

Advances in Modeling Solar System Internet Structures and their Data Flows

With an ever-increasing presence in space, there is also an increasing burden on existing communications infrastructure. We are heading towards an inflection point where the traditional approach of scheduled, single-path communications for space will no longer be viable. One answer is Delay Tolerant Networking (DTN), which takes the once disparate system of point-to-point links and unifies them in a networked architecture, thereby making communications more scalable. However, much work remains for discovering and harnessing the underlying theory of DTN. For example, in the terrestrial setting the interplay between routing domains is well-understood, however this is not the case in DTNs. In this paper, we build up the fundamental foundations of DTN, with an emphasis on modeling time varying networks and data flows across them, with examples of cross-domain routing in a DTN. A lofty goal of DTN is to enable the so-called Solar System Internet (SSI), which implies a standardized and robust suite of protocols. These protocols include routing across disconnected networks using store, carry, and forward mechanisms, which is necessary due to the disconnections, delays, and mobility intrinsic to space networks. Due to these factors, each of which generalize traditional networking, there is a deep and rich theory of DTNs. Here we build off of past successes to broaden this theory while striving to keep actionable results a goal for future implementations and operations. The approach includes modeling the unicast, broadcast, and multicast communications using the language of hypergraphs, which capture the geometric properties of such networked communications algebraically. Also inherent to these networks is their time-varying nature, particularly given mobility, and hence we also cultivate modeling techniques that respect this time dependence. This leads us to develop models using tools from category theory and algebraic geometry, which provide a language well-suited to describing synchronization and optimization over such networks. We also introduce and study a novel generalization of curvature applicable to time-evolving networks, which provides quantitative controls on diffusion processes on the network. Because an interplanetary network would feature links with propagation delays the preclude discovery (feedback) mechanisms, they will always feature a scheduled component. However, it is beneficial to support discovery where possible. While DTNs do not yet have strong definitions for their analogues of autonomous systems or network areas, we show how to join dynamic and schedule-based routing domains, using the language of sheaves, which marks progress towards such definitions. We conclude with a discussion of the progress made, as well as suggestions for future work.

Delay Tolerant Networking↗

Benefits of Sparse Tableau Over Nodal Admittance Formulation for Power-Flow Studies

Assembly of power-flow equations has traditionally begun from a nodal analysis formulation of the underlying transmission circuit's behavior. Most power-flow formulations encapsulate network constraints in the bus admittance matrix, Y bus . From a circuit perspective, this admittance representation restricts the network elements to be voltage controlled; resulting drawbacks treating zero-impedance branches in such applications as state estimation have long been recognized. This paper explores the advantages of the alternatives to Y bus -based formulations in power flow. It proposes a sparse tableau formulation (STF), and it demonstrates its computational efficiency, robustness, and generality in detailed comparison to traditional Y bus -based solution algorithms. In the examples of power networks ranging from 1888 to 82 000 buses, computational case studies indicate that STF provides comparable computational speed, while allowing simple treatment of zero-impedance branches and more reliably converging to solutions in many cases for which Y bus -based Newton algorithms diverge.

42 ENGINEERING↗

Collective network routing

Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

97 MATHEMATICS AND COMPUTING↗

The Transactive Energy Network Template Metamodel

While transactive energy, which is defined as an allocation of electricity based on dynamically discovered values or prices, has been extensively studied, its uptake and use has been slow. This report describes a tool, the transactive network template, which should hasten the creation and uptake of transactive energy networks. Some basic principles of transactive energy are familiar from existing wholesale electricity markets. Locational prices are calculated today for zones within bulk electric transmission systems. Locational prices differ while accounting for the locational costs of electricity generation and the losses and constraints incurred when electricity is transmitted from generators and distributed to consumers. A transactive energy network might include these transmission zones. However, current research strives to apply transactive energy also in electricity distribution circuits, buildings, and even for individual generating and consuming devices. At the same time, researchers explore how to apply transactive energy in real time during increasingly shorter time intervals. Automated computational agents become necessary as transactive energy becomes applied to smaller circuit zones and at faster dynamic timescales. A transactive energy network is an example of a multi-agent system. Each zone in the network is represented by its transactive agent, which makes decisions for and acts on behalf of a business entity that is responsible for and manages one of the circuit regions. A transactive energy network is also an example of a decentralized, distributed control system. Control decisions and responsibilities are distributed among the network’s transactive agents. The transactive agents are independent; that is, there typically is no centralized authority or oversight function. Instead, transactive agents exchange transactive signals and thereby negotiate the prices and quantities of electricity that they will exchange. Initially, the circuit regions and responsibilities of transactive agents appear to be very dissimilar. Each circuit region may comprise transmission, distribution, or building-level circuits. Each has a unique position and electrical connectivity within the transactive energy network. Each possesses unique assets that either generate or consume electricity, and these (e.g., renewable energy generator, diesel generator, aggregate utility load, building load, space conditioning, refrigerator, etc.) may further differ in their price flexibility and in their strategies for responding to dynamic electricity prices. Given such diversity, an implementer’s first inclination might be to start from scratch to define all these devices and to engineer their seemingly unique interactions. Given that each implementer’s perspective may be narrow within a transactive energy network, it is unlikely that uniquely engineered systems would interact well. This is where the transactive network template is applicable. The transactive network template is a metamodel that has been developed to guide implementers as they configure their own transactive agent within a network of such agents. The object-oriented design of the transactive network template provides basic code object types that may be used and extended by implementers to represent each of the assets in their circuit region. These objects further facilitate the transactive agent’s necessary computations, which are divided among responsibilities to schedule power usage, balance electric supply and demand, and coordinate the exchange of electricity with the other transactive agents. This report addresses the conceptual transactive network template design. Implementers are directed to more formal design documents and reference implementations. A Python™-based1 reference implementation of the transactive network template has been coded, and three implementations have been configured to represent a national laboratory and two university campuses. Version 2 of the transactive node template generalizes the market class and its methods to facilitate multiple, and more diverse market coordination mechanisms than were facilitated by and demonstrated using Version 1. Version 3 includes new Appendix B, which addresses the designs of methods that would make dynamic prices track approved electricity rates. In the future, the author wishes to make the transactive network template more generally applicable to networks that require more accurate power flow. Development of the transactive network template is jointly funded by the U.S. Department of Energy (DOE) Energy Efficiency and Renewable Energy and the DOE Office of Electricity. In late 2015, one of the first projects to be funded by the DOE Grid Laboratory Modernization Laboratory Consortium was the Clean Energy and Transactive Campus project, led by Pacific Northwest National Laboratory. DOE funds were matched by an investment by the Washington Department of Commerce through its Clean Energy Fund. The transactive network template was developed to guide the implementation of transactive energy networks within this project’s scope.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decomposition of Nonlinear Dynamical Networks via Comparison Systems

In analysis and control of large-scale nonlinear dynamical systems, a distributed approach is often an attractive option due to its computational tractability and usually low communication requirements. Success of the distributed control design relies on the separability of the network into weakly interacting subsystems such that minimal information exchange between subsystems is sufficient to achieve satisfactory control performance. While distributed analysis and control design for dynamical network have been well studied, decomposition of nonlinear networks into weakly interacting subsystems has not received as much attention. In this article we propose a vector Lyapunov functions based approach to quantify the energy-flow in a dynamical network via a model of a comparison system. Introducing a notion of power and energy flow in a dynamical network, we use sum-of-squares programming tools to partition polynomial networks into weakly interacting subsystems. Examples are provided to illustrate the proposed method of decomposition.

Maruf, Abdullah Al↗

Discrete Mathematical Approaches to Graph-Based Traffic Analysis

Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. In this paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.

Joslyn, Cliff A.↗

Distribution-Agnostic Stochastic Optimal Power Flow for Distribution Grids

This paper outlines a data-driven, distributionally robust approach to solve chance-constrained AC optimal power flow problems in distribution networks. Uncertain forecasts for loads and power generated by photovoltaic (PV) systems are considered, with the goal of minimizing PV curtailment while meeting power flow and voltage regulation constraints. A data- driven approach is utilized to develop a distributionally robust conservative convex approximation of the chance-constraints; particularly, the mean and covariance matrix of the forecast errors are updated online, and leveraged to enforce voltage regulation with predetermined probability via Chebyshev-based bounds. By combining an accurate linear approximation of the AC power flow equations with the distributionally robust chance constraint reformulation, the resulting optimization problem becomes convex and computationally tractable.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query it interactively, in order to e.g.\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.

Joslyn, Cliff A.↗