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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Impact of Trucking Network Flow on Preferred Biorefinery Locations in the Southern United States

The impact of the trucking transportation network flow was modeled for the southern United States. The study addresses a gap in existing research by applying a Bayesian logistic regression and Geographic Information System (GIS) geospatial analysis to predict biorefinery site locations. A one-way trucking cost assuming a 128.8 km (80-mile) haul distance was estimated by the Biomass Site Assessment model. The “median family income,” “timberland annual growth-to-removal ratio,” and “transportation delays” were significant in determining mill location. Transportation delays that directly impacted the costs of trucking are presented. Here, a logistic model with Bayesian inference was used to identify preferred site locations, and locations not preferential for a mill location. The model predicted that higher probability locations for smaller biomass mills (feedstock capacity, the size of sawmills) were in southern Alabama, southern Georgia, southeast Mississippi, southern Virginia, western Louisiana, western Arkansas, and eastern Texas. The higher probability locations for large capacity mills (feedstock capacity, the size for pulp and paper mills) were in southeastern Alabama, southern Georgia, central North Carolina, and the Mississippi Delta regions.

09 BIOMASS FUELS↗
NASA NTRSDate not supplied

Two-Dimensional Network Flow Modeling of No-Vent Tank Filling of A Cryogenic Tank With Thermo-Dynamic Vent System Assisted Injector

A finite volume-based network flow modeling tool, Generalized Fluid System Simulation Program (GFSSP), was used to simulate the no-vent filling of a cryogenic tank with a thermodynamic vent system assisted injector. The tank was discretized into nodes in the radial and axial directions to calculate two-dimensional axisymmetric flow with heat transfer between the solid wall and fluid. The nodes are connected by branches where momentum equations are solved to calculate the flowrates. The mass and energy conservation equations and the equation of state are solved to calculate pressure, temperature, and resident mass at the nodes. The energy conservation equations at the solid nodes were solved to calculate the temperature of the solid wall. The system of equations was solved by a combination of successive substitution and simultaneous Newton-Raphson method. The numerical model accounts for a) different regimes of pool boiling heat transfer, b) condensation of vapor around the spray droplets, c) condensation of vapor at the interface of the cooled injector and ullage, and d) condensation at the liquid-vapor interphase. The numerical predictions of tank pressure, filling rate, and wall temperatures were compared with the test data. The paper also presents the effect of nodal discretization by comparing the results of the 1D and 2D models and examines the effect of the droplet diameter on tank filling.

Nodal Model↗
NASA NTRS2023

Two-Dimensional Network Flow Modeling of No-Vent Tank Filling of A Cryogenic Tank With Thermo-Dynamic Vent System Assisted Injector

A finite volume-based network flow modeling tool, Generalized Fluid System Simulation Program (GFSSP), was used to simulate the no-vent filling of a cryogenic tank with a thermodynamic vent system assisted injector. The tank was discretized into nodes in the radial and axial directions to calculate two-dimensional axisymmetric flow with heat transfer between the solid wall and fluid. The nodes are connected by branches where momentum equations are solved to calculate the flowrates. The mass and energy conservation equations and the equation of state are solved to calculate pressure, temperature, and resident mass at the nodes. The energy conservation equations at the solid nodes were solved to calculate the temperature of the solid wall. The system of equations was solved by a combination of successive substitution and simultaneous Newton-Raphson method. The numerical model accounts for a) different regimes of pool boiling heat transfer, b) condensation of vapor around the spray droplets, c) condensation of vapor at the interface of the cooled injector and ullage, and d) condensation at the liquid-vapor interphase. The numerical predictions of tank pressure, filling rate, and wall temperatures were compared with the test data. The paper also presents the effect of nodal discretization by comparing the results of the 1D and 2D models and examines the effect of the droplet diameter on tank filling.

Nodal Model↗
NASA NTRS1990

A network flow model for load balancing in circuit-switched multicomputers

In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention.

Bokhari, Shahid H.↗
NASA NTRS1993

A network flow model for load balancing in circuit-switched multicomputers

In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention.

Bokhari, Shahid H.↗
NASA NTRS2010

A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions

This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.

Lee, Douglas W.↗
NASA NTRS2017

Adaptive Time Stepping for Transient Network Flow Simulation in Rocket Propulsion Systems

Fluid and thermal transients found in rocket propulsion systems such as propellant feedline system is a complex process involving fast phases followed by slow phases. Therefore their time accurate computation requires use of short time step initially followed by the use of much larger time step. Yet there are instances that involve fast-slow-fast phases. In this paper, we present a feedback control based adaptive time stepping algorithm, and discuss its use in network flow simulation of fluid and thermal transients. The time step is automatically controlled during the simulation by monitoring changes in certain key variables and by feedback. In order to demonstrate the viability of time adaptivity for engineering problems, we applied it to simulate water hammer and cryogenic chill down in pipelines. Our comparison and validation demonstrate the accuracy and efficiency of this adaptive strategy.

Majumdar, Alok K.↗
NASA NTRS2011

Network Flow Simulation of Fluid Transients in Rocket Propulsion Systems

Fluid transients, also known as water hammer, can have a significant impact on the design and operation of both spacecraft and launch vehicle propulsion systems. These transients often occur at system activation and shutdown. The pressure rise due to sudden opening and closing of valves of propulsion feed lines can cause serious damage during activation and shutdown of propulsion systems. During activation (valve opening) and shutdown (valve closing), pressure surges must be predicted accurately to ensure structural integrity of the propulsion system fluid network. In the current work, a network flow simulation software (Generalized Fluid System Simulation Program) based on Finite Volume Method has been used to predict the pressure surges in the feed line due to both valve closing and valve opening using two separate geometrical configurations. The valve opening pressure surge results are compared with experimental data available in the literature and the numerical results compared very well within reasonable accuracy (< 5%) for a wide range of inlet-to-initial pressure ratios. A Fast Fourier Transform is preformed on the pressure oscillations to predict the various modal frequencies of the pressure wave. The shutdown problem, i.e. valve closing problem, the simulation results are compared with the results of Method of Characteristics. Most rocket engines experience a longitudinal acceleration, known as "pogo" during the later stage of engine burn. In the shutdown example problem, an accumulator has been used in the feed system to demonstrate the "pogo" mitigation effects in the feed system of propellant. The simulation results using GFSSP compared very well with the results of Method of Characteristics.

Bandyopadhyay, Alak↗
DOE OSTI2026

From Points to Planes: A Workflow for Converting Three‐Dimensional Point Cloud Data Into Discrete Fracture Network Flow and Transport Models

We present the Point cLoud Algorithm for NEtwork Extraction of Discrete Fracture Networks (PLANE-DFN), a point cloud–based algorithm for automatic fracture network extraction designed to support discrete fracture network (DFN) modeling workflows. PLANE-DFN segments three-dimensional fracture planes from raw point cloud data using RANdom SAmple Consensus coupled with statistical outlier removal and density-based clustering to isolate individual fracture features. Each candidate plane is constrained against site-specific structural constraints based on strike and dip. After segmentation, each fracture is converted into a 2-D convex polygon suitable for meshing and simulation. The PLANE-DFN algorithm is validated by comparing geometric and flow and transport data against data from dfnWorks simulations with ensembles of plane-fit networks. We find that the flow and transport in plane-fit networks are comparable to dfnWorks-generated networks when realistic network geometry is maintained. The PLANE-DFN algorithm provides an automated and streamlined workflow to transform point clouds of data into DFN network geometry.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1976

Analysis of a solar collector field water flow network

A number of methods are presented for minimizing the water flow variation in the solar collector field for the Solar Building Test Facility at the Langley Research Center. The solar collector field investigated consisted of collector panels connected in parallel between inlet and exit collector manifolds to form 12 rows. The rows were in turn connected in parallel between the main inlet and exit field manifolds to complete the field. The various solutions considered included various size manifolds, manifold area change, different locations for the inlets and exits to the manifolds, and orifices or flow control valves. Calculations showed that flow variations of less than 5 percent were obtainable both inside a row between solar collector panels and between various rows.

Rohde, J. E.↗
DOE OSTI2021

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗
DOE OSTI2022

Communication systems and methods for authenticating data packets within network flow

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.

Bush, Stephen Francis↗
DOE OSTI2021

Reconstructing porous media using generative flow networks

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.

58 GEOSCIENCES↗
NASA NTRS2002

Incorporation of Condensation Heat Transfer in a Flow Network Code

Pure water is distilled from waste water in the International Space Station. The distillation assembly consists of an evaporator, a compressor and a condenser. Vapor is periodically purged from the condenser to avoid vapor accumulation. Purged vapor is condensed in a tube by coolant water prior to entering the purge pump. The paper presents a condensation model of purged vapor in a tube. This model is based on the Finite Volume Method. In the Finite Volume Method, the flow domain is discretized into multiple control volumes and a simultaneous analysis is performed.

Anthony, Miranda↗
NASA NTRS2017

Fluid Transient Analysis during Priming of Evacuated Line

Water hammer analysis in pipe lines, in particularly during priming into evacuated lines is important for the design of spacecraft and other in-space application. In the current study, a finite volume network flow analysis code is used for modeling three different geometrical configurations: the first two being straight pipe, one with atmospheric air and other with evacuated line, and the third case is a representation of a complex flow network system. The numerical results show very good agreement qualitatively and quantitatively with measured data available in the literature. The peak pressure and impact time in case of straight pipe priming in evacuated line shows excellent agreement.

Bandyopadhyay, Alak↗