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 91 records · Page 5

LEISURE: Load-Balanced Network-Wide Traffic Measurement and Monitor Placement

We report that network-wide traffic measurement is of interest to network operators to uncover global network behavior for the management tasks of traffic accounting, debugging or troubleshooting, security, and traffic engineering. Increasingly, sophisticated network measurement tasks such as anomaly detection and security forensic analysis are requiring in-depth fine-grained flow-level measurements. However, performing in-depth per-flow measurements (e.g., detailed payload analysis) is often an expensive process. Given the fast-changing Internet traffic landscape and large traffic volume, a single monitor is not capable of accomplishing the measurement tasks for all applications of interest due to its resource constraint. Moreover, uncovering global network behavior requires network-wide traffic measurements at multiple monitors across the network since traffic measured at any single monitor only provides a partial view and may not be sufficient or accurate. These factors call for coordinated measurements among multiple distributed monitors. In this paper, we present a centralized optimization framework, LEISURE (Load- EqualIzed meaSUREment), for load-balancing network measurement workloads across distributed monitors. Specifically, we consider various load-balancing problems under different objectives and study their extensions to support both fixed and flexible monitor deployment scenarios. We formulate the latter flexible monitor deployment case as an MILP (Mixed Integer Linear Programming) problem and propose several heuristic algorithms to approximate the optimal solution and reduce the computation complexity. We evaluate LEISURE via detailed simulations on Abilene and GEANT network traces to show that LEISURE can achieve much better load-balanced performance (e.g., 4.75 × smaller peak workload and 70 × smaller variance in workloads) across all coordinated monitors in comparison to a naive solution (uniform assignment) to accomplish network-wide traffic measurement tasks under the fixed monitor deployment scenario. Lastly, we also show that under the flexible monitor deployment setting, our heuristic solutions can achieve almost the same load-balancing performance as the optimal solution while reducing the computation times by a factor up to 22.5 × in Abilene and 800 × in GEANT.

42 ENGINEERING↗

Primary-Side Power Flow Control of Wireless Power Transfer for Electric Vehicle Charging

Various noncontacting methods of plug-in electric vehicle charging are either under development or now deployed as aftermarket options in the light-duty automotive market. Wireless power transfer (WPT) is now the accepted term for wireless charging and is used synonymously for inductive power transfer and magnetic resonance coupling. WPT technology is in its infancy; standardization is lacking, especially on interoperability, center frequency selection, magnetic fringe field suppression, and the methods employed for power flow regulation. This paper proposes a new analysis concept for power flow in WPT in which the primary provides frequency selection and the tuned secondary, with its resemblance to a power transmission network having a reactive power voltage control, is analyzed as a transmission network. Analysis is supported with experimental data taken from Oak Ridge National Laboratory s WPT apparatus. Lastly, this paper also provides an experimental evidence for frequency selection, fringe field assessment, and the need for low-latency communications in the feedback path.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Uniform redundancy allocation maximizes the robustness of flow networks against cascading failures

We study the robustness of flow networks against cascading failures under a partial load redistribution model. In particular, we consider a flow network of N lines with initial loads L 1 ,...,L N and free spaces (i.e., redundant space) S 1 ,...,S N that are independent and identically distributed with joint distribution P LS (x,y) = P[L ≤ x, S ≤ y]. The capacity C i is the maximum load allowed on line i and is given by C i = L i + S i . Furthermore, when a line fails due to overloading, it is removed from the system and (1 – ε) fraction of the load it was carrying is redistributed equally among all remaining lines in the system. The rest (i.e., ε fraction) of the load is assumed to be lost or absorbed, e.g., due to advanced circuitry disconnecting overloaded power lines or an interconnected network or material absorbing a fraction of the flow from overloaded lines. We analyze the robustness of this flow network against random attacks that remove a p fraction of the lines. Our contributions include (i) deriving the final fraction of alive lines n ∞ (p,ε) for all p,εϵ(0,1) and confirming the results via extensive simulations; (ii) showing that partial redistribution might lead to (depending on the parameter 0 < ε ≤ 1) the order of transition at the critical attack size p* changing from first to second-order; and (iii) proving analytically that flow networks achieve maximum robustness [quantified by the area ∫$^{1}_{0}$ n ∞ (p,ε)dp] when all lines have the same free space regardless of their initial load. The optimality of equal free-space allocation is also confirmed on real-world data from the UK National Power Grid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Analysis of Electricity Price Differentials for the Utah Office of Energy Development

Operation Gigawatt is a vision for Utah to meet its growing energy needs with a focus on doubling energy generation. One of the greatest challenges to meet this goal will be the transmission and distribution system. Utah seeks analysis to inform discussions on new generation, the likely network congestion based on new power flows, and modeling of the state's energy infrastructure. To support this need, LBNL developed a baseline understanding of recent historical congestion in the existing transmission system based on electricity market prices. The resulting products visualize and provide metrics on congestion within Utah and between Utah and its neighbors during 2015-2023.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Finding Hidden Patterns in High Resolution Wind Flow Model Simulations

Wind flow data is critical in terms of investment decisions and policy making. High resolution data from wind flow model simulations serve as a supplement to the limited resource of original wind flow data collection. Given the large size of data, finding hidden patterns in wind flow model simulations are critical for reducing the dimensionality of the analysis. In this work, we first perform dimension reduction with two autoencoder models: the CNN-based autoencoder (CNN-AE) [1], and hierarchical autoencoder (HIER-AE) [2], and compare their performance with the Principal Component Analysis (PCA). We then investigate the super-resolution of the wind flow data. By training a Generative Adversarial Network (GAN) with 300 epochs, we obtained a trained model with 2× resolution enhancement. We compare the results of GAN with Convolutional Neural Network (CNN), and GAN results show finer structure as expected in the data field images. Also, the kinetic energy spectra comparisons show that GAN outperforms CNN in terms of reproducing the physical properties for high wavenumbers and is critical for analysis where high-wavenumber kinetics play an important role.

97 MATHEMATICS AND COMPUTING↗

Dual FIB-SEM 3D imaging and lattice boltzmann modeling of porosimetry and multiphase flow in chalk.

Mercury intrusion porosimetry (MIP) is an often-applied technique for determining pore throat distributions and seal analysis of fine-grained rocks. Due to closure effects, potential pore collapse, and complex pore network topologies, MIP data interpretation can be ambiguous, and often biased toward smaller pores in the distribution. We apply 3D imaging techniques and lattice-Boltzmann modeling in interpreting MIP data for samples of the Cretaceous Selma Group Chalk. In the Mississippi Interior Salt Basin, the Selma Chalk is the apparent seal for oil and gas fields in the underlying Eutaw Fm., and, where unfractured, the Selma Chalk is one of the regional-scale seals identified by the Southeast Regional Carbon Sequestration Partnership for CO2 injection sites. Dual focused ion - scanning electron beam and laser scanning confocal microscopy methods are used for 3D imaging of nanometer-to-micron scale microcrack and pore distributions in the Selma Chalk. A combination of image analysis software is used to obtain geometric pore body and throat distributions and other topological properties, which are compared to MIP results. 3D data sets of pore-microfracture networks are used in Lattice Boltzmann simulations of drainage (wetting fluid displaced by non-wetting fluid via the Shan-Chen algorithm), which in turn are used to model MIP procedures. Results are used in interpreting MIP results, understanding microfracture-matrix interaction during multiphase flow, and seal analysis for underground CO2 storage.

03 NATURAL GAS↗

Simulation of solute transport through heterogeneous networks: analysis using the method of moments and the statistics of local transport characteristics

We used a time domain random walk approach to simulate passive solute transport in networks. In individual pores, solute transport was modeled as a combination of Poiseuille flow and Taylor dispersion. The solute plume data were interpreted via the method of moments. Analysis of the first and second moments showed that the longitudinal dispersivity increased with increasing coefficient of variation of the pore radii CV and decreasing pore coordination number Z. The third moment was negative and its magnitude grew linearly with time, meaning that the simulated dispersion was intrinsically non-Fickian. The statistics of the Eulerian mean fluid velocities $\hat{u}_i$, the Taylor dispersion coefficients $\hat{D}_i$ and the transit times $\hat{t}_i$ were very complex and strongly affected by CV and Z. In particular, the probability of occurrence of negative velocities grew with increasing CV and decreasing Z. Hence, backward and forward transit times had to be distinguished. The high-τ branch of the transit-times probability curves had a power law form associated to non-Fickian behavior. However, the exponent was insensitive to pore connectivity, although variations of Z affected the third moment growth. Thus, we conclude that both the low- and high-τ branches played a role in generating the observed non-Fickian behavior.

Li, Min↗

Analyzing Impact of Distributed PV Generation on Integrated Transmission & Distribution System Voltage Stability—A Graph Trace Analysis Based Approach

The use of a Graph Trace Analysis (GTA)-based power flow for analyzing the voltage stability of integrated Transmission and Distribution (T&D) networks is discussed in the context of distributed Photovoltaic (PV) generation. The voltage stability of lines and the load carrying capability of buses is analyzed at various PV penetration levels. It is shown that as the PV generation levels increase, an increase in the steady state voltage stability of the system is observed. Moreover, within certain regions of stability margin changes, changes in voltage stability margins of transmission lines are shown to be linearly related to changes in the loading of the lines. Two case studies are presented, where one case study involves a model with eight voltage levels and 784,000 nodes. In one case study, a voltage-stability heat map is used to demonstrate the identification of weak lines and buses.

14 SOLAR ENERGY↗

Quantifying Dam-Induced Fluctuations in Streamflow Frequencies Across the Colorado River Basin

Periodic fluctuations in natural streamflow are a major driver of river ecosystem dynamics and water resource management. However, most U.S. rivers are impacted both by long-term hydroclimatic trends and dams that alter flow variability. Despite these impacts, it remains largely unexplored how dams affect the dominant frequencies of natural streamflow over a highly regulated river network. We investigated the entire Colorado River Basin (CRB) to understand how the annual (10–14 months) and multi-annual (24–60 months) frequencies in natural flow regimes have been progressively altered by dams. Given the significant alteration over the CRB, we captured changes in streamflow frequencies between naturalized and observed monthly flows via wavelet analysis. Based on the similarity of changes in streamflow frequencies (annual and multi-annual) over the last 30 years, sections of the riverine network were classified into four groups. The annual frequency was relatively well preserved downstream of Hoover Dam, while showing a systematic trend of alteration downstream of Glen Canyon Dam until Hoover Dam. Meanwhile, the multi-annual frequency component was highly altered for the entire Lower Colorado main stem (i.e., downstream of Glen Canyon). We also identified dams with significant impacts on streamflow frequency by comparing wavelet coherence estimates. This study advances the notion that dams fundamentally alter river flow regimes across multiple frequencies and with varying amplitudes over time and space, with alteration propagating – or being dampened – by both hydroclimatic fluctuations and water resource management.

54 ENVIRONMENTAL SCIENCES↗

A Study of Scientometric Methods to Identify Emerging Technologies via Modeling of Milestones

This work examines a scientometric model that tracks the emergence of an identified technology from initial discovery (via original scientific and conference literature), through critical discoveries (via original scientific, conference literature and patents), transitioning through Technology Readiness Levels (TRLs) and ultimately on to commercial application. During the period of innovation and technology transfer, the impact of scholarly works, patents and on-line web news sources are identified. As trends develop, currency of citations, collaboration indicators, and on-line news patterns are identified. The combinations of four distinct and separate searchable on-line networked sources (i.e., scholarly publications and citation, patents, news archives, and online mapping networks) are assembled to become one collective network (a dataset for analysis of relations). This established network becomes the basis from which to quickly analyze the temporal flow of activity (searchable events) for the example subject domain we investigated.

99 GENERAL AND MISCELLANEOUS↗

Scientometric methods for identifying emerging technologies

Provided is a method of generating a scientometric model that tracks the emergence of an identified technology from initial discovery (via original scientific and conference literature), through critical discoveries (via original scientific, conference literature and patents), transitioning through Technology Readiness Levels (TRLs) and ultimately on to commercial application. During the period of innovation and technology transfer, the impact of scholarly works, patents and on-line web news sources are identified. As trends develop, currency of citations, collaboration indicators, and on-line news patterns are identified. The combinations of four distinct and separate searchable on-line networked sources (i.e., scholarly publications and citation, worldwide patents, news archives, and on-line mapping networks) are assembled to become one collective network (a dataset for analysis of relations). This established network becomes the basis from which to quickly analyze the temporal flow of activity (searchable events) for the example subject domain.

42 ENGINEERING↗

AR-CITE: Analysis of Search Results for the Clarification and Identification of Technology Emergence

The Analysis of Search Results for the Clarification and Identification of Technology Emergence (AR-CITE) computer code examines a scientometric model that tracks the emergence of an identified technology from initial discovery (via original scientific and conference literature), through critical discoveries (via original scientific, conference literature and patents), transitioning through Technology Readiness Levels (TRLs) and ultimately on to commercial currency of citations, collaboration indicators, and on-line news patterns are identified. The combinations of four distinct and separate searchable on-line networked sources (i.e. scholarly publications and citation, world patents, news archives, and on-line mapping networks) are assembled to become one collective network (a dataset for analysis of relations). This established network becomes the basis from which to quickly analyze the temporal flow of activity (searchable events) for the subject domain to be clarified and identified.

Source record↗

Solver for hardware based computing

Full-AC load flow constitutes a core computation in power system analysis. A performance gain with a hardware implementation of a sparse-linear solver using a Field Programmable Gate Array (FPGA) is achieved by use of a DC network emulation of the power system bus. Analog Behavioral Models (ABMs) are used in an efficient strategy for designing analog emulation engines for large-scale power system computation. A generator model is also developed using analog circuits for load flow emulation for power system analysis to reduce computation time. The generator model includes reconfigurable parameters using operational transconductance amplifiers (OTAs). The circuit module is used with other reconfigurable circuits, i.e., transmission lines and loads.

97 MATHEMATICS AND COMPUTING↗

Deep Packet/Flow Analysis using GPUs

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

97 MATHEMATICS AND COMPUTING↗

Deep Packet/Flow Analysis using GPUs

aDeep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally anti-parallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysi s framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. Evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

Gong, Qian↗