SEARCH · Search NASA

Results for “CONGESTION”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

A Strategic Approach for Dense, Integrated, Vehicle Navigation

Drone usage has been on the rise in recent years with applications that include parcel delivery, wildlife protection, precision farming, law enforcement, and industrial inspection, just to name a few. Once regulations and safety policies are put in place to allow for the widespread use of unmanned drones, the number of aircraft in the National Airspace System (NAS) is expected to skyrocket to millions, potentially congesting the airspace which increases the likelihood of separation violations and possibly incidents. Currently, flight infrastructure can only support a few thousand aircraft flying over the United States National Airspace System (NAS) at any given time. A delay at one airport can send ripple effects throughout the system, causing more delays and missed connections. In air traffic control, separation is the concept of keeping an “ownship” aircraft outside a minimum distance from “intruder” aircraft to reduce the risk of the aircraft colliding, as well as preventing accidents due to secondary factors, such as wake turbulence. Maintaining proper separation is often a safety critical property for fixed-wing drones in the airspace. This paper addresses drone separation in time and distance for high volume corridors (en route) and lanes (on ground), merging as well as crossing intersections of multiple corridors/lanes. In this paper, the term drone is applied to both Unmanned Aerial Vehicle (UAV) and small Unmanned Aircraft System (UAS) vehicles operating autonomously. There exists a gamut of approaches to the merging and crossing problems. At one end of the extreme are the conservative yet low cost and verifiable solutions of today that deal with two drones at a time. At the other end are complex Machine Learning-based solutions with high computing requirements for fully autonomous drones of the future that are expected to handle all contentions. This paper presents a feasible and verifiable strategic approach to these problems that is based on distributed cooperation between the drones and the infrastructure. Three phases of the strategic approach (Prepare, Adjust, Commit) are presented. Simulation results are presented that show the proposed approach is stable and resilient to induced perturbations and guarantees a set of fixed-wing drones to merge and cross intersections by adjusting their speed based on their distance to the aircraft in front of them while remaining in the equilibrium state. The equilibrium state is defined as the state when a set of n aircraft move at a relatively constant speed and uniform spacing from each other in a congested system. A congested system is defined as the state when at least one aircraft cannot move at its maximum allowed speed. Unlike existing centralized and pre-planned approaches, the proposed solution is fully distributed and enables autonomous aircraft to decide to adjust their speed and distance with respect to the preceding aircraft, dynamically. Simulation results are presented that assess the feasibility of the approach.

Distributed↗

NASA NTRSDate not supplied

A Strategic Approach for Dense, Integrated, Vehicle Navigation

Distributed↗

DOE OSTI2015

LADS: Optimizing Data Transfers using Layout-Aware Data Scheduling

While future terabit networks hold the promise of signifi- cantly improving big-data motion among geographically distributed data centers, significant challenges must be overcome even on today s 100 gigabit networks to real- ize end-to-end performance. Multiple bottlenecks exist along the end-to-end path from source to sink. Data stor- age infrastructure at both the source and sink and its in- terplay with the wide-area network are increasingly the bottleneck to achieving high performance. In this paper, we identify the issues that lead to congestion on the path of an end-to-end data transfer in the terabit network en- vironment, and we present a new bulk data movement framework called LADS for terabit networks. LADS ex- ploits the underlying storage layout at each endpoint to maximize throughput without negatively impacting the performance of shared storage resources for other users. LADS also uses the Common Communication Interface (CCI) in lieu of the sockets interface to use zero-copy, OS-bypass hardware when available. It can further im- prove data transfer performance under congestion on the end systems using buffering at the source using flash storage. With our evaluations, we show that LADS can avoid congested storage elements within the shared stor- age resource, improving I/O bandwidth, and data transfer rates across the high speed networks.

Data Management↗

DOE OSTI2020

High Performance Computing Traffic Simulations for Real-Time Traffic Control of Mobility in Chattanooga Region

In 2019, highway congestion wasted over 3 billion gallons of fuel and caused 8.8 billion hours of lost productivity.1 Research has shown that introducing near-real time traffic controls can significantly reduce congestion. Validated and calibrated traffic simulations enable the modeling of transportation systems and the evaluation of different traffic control actions and schemes given a variety of circumstances that represent likely future scenarios. The developed scenarios can inform the deployment of controls in near real-time to improve freight and passenger vehicle congestion and energy use. In this work, we present simulations used to model the traffic in the Chattanooga, Tennessee, metropolitan area. Simulations were constructed and calibrated using a variety of local, data science enhanced, data sources utilizing open source software including the Simulation of Urban Mobility (SUMO) simulator. High-Performance Computing (HPC) provides a scalable platform with enough computing for the high-fidelity simulation of many scenarios and the application of advance data science especially for large-scale systems. Our simulations include microscopic simulations at a corridor level for traffic signal control, and mesoscopic simulations to evaluate regional operational controls and infrastructure.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Visualization and Quantification of Wind Induced Variability in Hydrogen Clouds Following Releases of Liquid Hydrogen: Preprint

Well characterized experimental data for consequence model validation is important in progressing the use of liquid hydrogen as an energy carrier. In 2019, the Health and Safety Executive (HSE) undertook a series of liquid hydrogen dispersion and combustion experiments as a part of the Pre-normative Research into the Safe Use of Liquid Hydrogen (PRESLHY) project. In partnership between the National Renewable Energy Laboratory (NREL) and HSE, time and spatially varying hydrogen concentration measurements were made in 25 dispersion experiments and 23 congested ignition experiments associated with PRESLHY WP3 and WP5, respectively. These measurements were undertaken using the hydrogen wide area monitoring system developed by NREL. During the 23 congested ignition experiments, high variability was observed in the measured explosion severity during experiments with similar initial conditions. This led to the conclusion that wind, including localized gusts, had a large influence on the dispersion of the hydrogen, and therefore the quantity of hydrogen that was present in the congested region of the explosions. Using the hydrogen concentration measurements taken immediately prior to ignition, the hydrogen clouds were visualized in an attempt to rationalize the variability in overpressure between the tests. Gaussian process regression was applied to quantify the variability of the measured hydrogen concentrations. This analysis could also be used to guide modifications in experimental designs for future research on hydrogen combustion behavior.

HSR&D↗

DOE OSTI2016

I/O-aware bandwidth allocation for petascale computing systems

In the Big Data era, the gap between the storage performance and an appli- cation's I/O requirement is increasing. I/O congestion caused by concurrent storage accesses from multiple applications is inevitable and severely harms the performance. Conventional approaches either focus on optimizing an ap- plication's access pattern individually or handle I/O requests on a low-level storage layer without any knowledge from the upper-level applications. In this paper, we present a novel I/O-aware bandwidth allocation framework to coordinate ongoing I/O requests on petascale computing systems. The motivation behind this innovation is that the resource management system has a holistic view of both the system state and jobs' activities and can dy- namically control the jobs' status or allocate resource on the y during their execution. We treat a job's I/O requests as periodical subjobs within its lifecycle and transform the I/O congestion issue into a classical scheduling problem. Based on this model, we propose a bandwidth management mech- anism as an extension to the existing scheduling system. We design several bandwidth allocation policies with different optimization objectives either on user-oriented metrics or system performance. We conduct extensive trace- based simulations using real job traces and I/O traces from a production IBM Blue Gene/Q system at Argonne National Laboratory. Experimental results demonstrate that our new design can improve job performance by more than 30%, as well as increasing system performance.

I/O congestion↗

DOE OSTI2025

Design, Preparation, and Execution of the 100-AV Field Test for the CIRCLES Consortium: Methodology and Implementation of the Largest Mobile Traffic Control Experiment to Date

This article presents the comprehensive design, setup, execution, and evaluation of the MegaVanderTest (MVT) experiment conducted by the Congestion Impacts Reduction via CAV-in-the-Loop Lagrangian Energy Smoothing (CIRCLES) Consortium, which aimed to mitigate traffic congestion using partially autonomous vehicles (AVs) (see “Summary”). The experiment involved 100 vehicles on Nashville’s Interstate 24 (I-24) highway, utilizing various control algorithms to smooth stop-and-go traffic waves. The execution of the MVT experiment required a coordinated effort from multiple teams. This article details the meticulous planning process, the coordinated efforts of multiple teams, and the innovative use of a dynamic agent-based simulation framework for traffic evaluation. Here, the contributions of this work include demonstrating and providing a detailed roadmap for large-scale live traffic experiments, illustrating the lessons learned from the MVT experiment, and introducing the other articles in this issue and their complementary relationship in the MVT experiment.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2026

Interregional Transmission Operational Coordination (IRTOC)

This report presents a modeling and evaluation framework developed through the Inter-Regional Transmission Operational Coordination (IRTOC) project to study market-to-market (M2M) congestion management across day-ahead and real-time markets. The framework extends the Sienna platform through Sienna Decomposition, a multi-stage evaluation architecture that enables flexible representation of multiple regions and systematic assessment of alternative market coordination designs. Additional modeling capabilities include reserve deliverability constraints, High-Voltage Direct Current (HVDC) optimization for Alternating Current (AC) congestion management, and several real-time distributed coordination algorithms. Case studies using the RTS-GMLC test system and a large-scale Eastern Interconnection model demonstrate that the framework can evaluate alternative coordination structures and quantify their economic and operational impacts. The proposed framework provides a scalable platform for analyzing inter-regional coordination strategies in large-scale electricity markets.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2017

Multi-time scale control of demand flexibility in smart distribution networks

This study presents a multi-timescale control strategy to deploy demand flexibilities of electric vehicles (EV) for providing system balancing and local congestion management by simultaneously ensuring economic benefits to participating actors. First, the EV charging problem from consumer, aggregator, and grid operator’s perspective is investigated. A hierarchical control architecture (HCA) comprising scheduling, coordinative, and adaptive layers is then designed to realize their coordinative goal. This is realized by integrating a multi-time scale control, which works from a day-ahead scheduling up to real-time adaptive control. The performance of the developed method is investigated with high EV penetration in a typical distribution network. The simulation results demonstrates that HCA exploit EV flexibility to solve grid unbalancing and congestions with simultaneous maximization of economic benefits by ensuring EV participation to day-ahead, balancing, and regulation markets. For the given network configuration and pricing structure, HCA ensures the EV owners to get paid up to 5 times the cost they were paying without control.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRSDate not supplied

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n1/4) rounds of communication and O ̃(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

NASA NTRSDate not supplied

Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n 1/4 ) rounds of communication and O ̃(n 9/4 ) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.

quantum computing↗

DOE OSTI2024

Interregional Transmission Operational Coordination

This presentation will discuss challenges and opportunities on interregional coordination in the areas of interchange transaction, congestion management, reserve sharing and deliverability across multi-stage operational processes. It will then provide an overview of the interregional transmission operational coordination (IRTOC) project that currently focuses on congestion management, including Inter-regional transmission coordination in real time operations and operational planning, HVDC optimization (intra- and interregional), ancillary service deliverability (intra- and interregional). In addition, it will discuss the Sienna-Decomposition tool development to systematically study interregional coordination methods.

congestion management↗

DOE OSTI2016

The packing problem of uncertain multicasts

Summary Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP‐hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority‐based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them.

Ren, Bangbang↗

DOE OSTI2019

Percutaneous Orthotopic IVC Construction in a Pediatric Patient with Symptomatic IVC Agenesis

Inferior vena cava agenesis is an uncommon condition usually attributed to embryologic dysgenesis. When symptomatic, unprovoked deep venous thrombosis and/or lower extremity venous congestion are the most frequent manifestations. Its rarity has precluded consensus regarding appropriate management. Symptomatic chronic venous congestion requires surgical construction of auxiliary venous pathways, which may involve substantial morbidity, prolonged recovery and extensive scarring. We report successful minimally invasive management via percutaneous endovascular orthotopic inferior vena cava construction in a pediatric patient, thereby obviating the need for surgery and its associated morbidity. Level of Evidence: Level IV, case study.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2025

Bayesian modeling of traffic-related air pollutants: A case study of urban transportation and air quality dynamics in Columbia, South Carolina

Traffic emissions significantly impact near-road air quality and public health. This research applies a Bayesian modeling framework to investigate these impacts using high-resolution traffic and air pollutant data from an urban corridor in Columbia, South Carolina. Despite a data collection period truncated by the COVID-19 lockdown, the Bayesian approach successfully identified significant predictors and quantified model uncertainty. Employing Bayesian Model Selection and Averaging enhanced prediction accuracy and evaluated model uncertainty. Findings indicate that higher temperatures and increased moisture levels elevate particulate matter (PM 1.0 , PM 2.5 , PM 10 ) concentrations, while traffic speed significantly affects nitrogen dioxide (NO 2 ) levels. Specifically, higher average traffic speeds (indicative of smoother flow) correspond to lower NO 2 concentrations, suggesting that less congested conditions reduce NO 2 emissions. This study highlights the robustness of Bayesian methods for generating reliable air quality insights even under data-constrained conditions. The findings underscore the importance of traffic flow management (e.g., reducing congestion) for mitigating near-road NO 2 exposure and provide a basis for developing targeted public health strategies.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2026

A review of United States energy-only generator interconnection service policy and considerations for reform

Grid interconnection has emerged as a significant obstacle to the development of new electricity resources. There is growing interest in energy-only interconnection, which is an interconnection service option meant to allow the interconnection of new generators without ensuring their energy deliverability during all hours through the transmission system to customers. This approach potentially avoids upfront congestion-related transmission upgrades but could increase curtailment risk. Interest in energy-only interconnection is shaped by incomplete understanding of how interconnection policy functions in different jurisdictions, a knowledge gap that makes it difficult to determine how energy-only interconnection might be better used or re-designed. In this paper, we provide a regulatory review of energy-only interconnection in U.S. interconnection policy and practice, identifying jurisdictions in which rules are close to -or farther from-the theoretical concept of energy-only interconnection service. We find substantial jurisdictional differences in how energy-only interconnection is implemented, driven by differences in resource adequacy frameworks, real-time transmission operations, and state-level procurement practices. U.S. regulators have preferred local jurisdictional flexibility over federal prescription of interconnection study methods and procedures, which also contributes to differences among regions. Such findings raise fundamental questions about whether competition policies in electricity markets should extend beyond spot energy markets and into more prescriptive guidelines around interconnection rules and market entry. This paper sheds light on tensions that energy-only interconnection raises in allowing generators to access the transmission system on an as available basis and discusses how controlling thresholds for congestion-related network upgrades may be a barrier to electricity market entry.

Gorman, Will↗

DOE OSTI2018

Calibers: A Bandwidth Calendaring Paradigm for Science Workflows

Many scientific workflows require large data transfers between distributed instrument facilities, storage and computing resources. To ensure that these resources are maximally utilized, R&E networks connecting these resources must ensure that an inherently unpredictable network behaves predictably. In practice, this amounts to the per-application over-provisioning of network resources in an attempt to guarantee that adequate throughput is provided to users. This often results in resource under-utilization over time. One promising solution is the use of deadlines and bandwidth calendaring. In this approach, "fair" resource allocation is replaced with deadline-based resource allocation. However, these approaches often suffer from issues in efficiently regulating resource allocation and failure modes. Therefore, our solution, Calibers, approaches bandwidth calendaring and deadline-awareness in a different way. Calibers uses shaping, metering, and pacing at the edge of the network and end-system to provide participating clients the ability to schedule bandwidth reservations without having to worry about network noise from non-participating clients. Calibers can also fail back to the fair resource allocation of underlying transport protocols if necessary. For example, if a non-participating flow somehow enters the core of the network, or a sudden network change causes the available bandwidth to be exceeded, the underlying transport protocol congestion avoidance implementation will be able to handle the congestion as it normally would. Furthermore, Calibers provides a novel simulation method and resource allocation algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

Cardiovascular Comorbidity and Mortality in Men With Prostate Cancer Treated With Brachytherapy-Based Radiation With or Without Hormonal Therapy

Purpose: To assess the impact of coronary artery disease (CAD) risk factors and sequelae on the risk of all-cause mortality (ACM) in men treated for prostate cancer (PC). Methods and Materials: The study cohort comprised 5077 men with PC consecutively treated with curative intent between 1997 and 2006 at the Chicago Prostate Cancer Center. Cox and Fine and Gray's competing risks regression multivariable analyses were performed, assessing whether cardiovascular comorbidity impacted the risk of ACM and PC-specific mortality, respectively, adjusting for CAD risk factors (diabetes mellitus, hypercholesterolemia, or hypertension) and sequelae (congestive heart failure or myocardial infarction), age, year and type of treatment, and known PC prognostic factors. Results: When compared with men with no comorbidity there was a significantly increased risk of ACM in men with congestive heart failure or myocardial infarction (adjusted hazard ratio [AHR] 1.96, P<.001) and in men with diabetes mellitus (AHR 1.60, P=.03) and hypertension (AHR 1.25, P=.04). In contrast, men with hypercholesterolemia had a similar risk of ACM (AHR 0.68, P=.17) when compared with men with no comorbidity. Other factors associated with a significantly increased risk of ACM included age (AHR 1.09, P<.001), prostate-specific antigen level (AHR 1.25, P=.008), and Gleason score 8-10 disease (AHR 1.71, P=.003). Cardiovascular comorbidity did not impact the risk of PC-specific mortality. Conclusions: In addition to age and unfavorable PC prognostic factors, select CAD risk factors and sequelae are associated with an increased risk of ACM in men treated for PC. These comorbidity prognostic factors predict time courses of mortality from competing causes, which may be factored into the decision-making process when considering management options for PC in a given individual.

62 RADIOLOGY AND NUCLEAR MEDICINE↗