Search NASA⌕ Search

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.

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

At least 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

FTLADS: Object-Logging Based Fault-Tolerant Big Data Transfer System Using Layout Aware Data Scheduling

The layout-aware data scheduling (LADS) data movement framework optimizes congestion for end-to-end data transfers. During data transfer, LADS can avoid congested storage elements by exploiting the underlying storage layout at each endpoint. This improves the I/O bandwidth and hence the data transfer rate across high-speed networks. However, the absence of fault tolerance (FT) in LADS results in data retransmission overhead and may lead to possible data integrity issues upon faults. In this paper, we propose object-logging FT mechanisms to avoid transmitting the objects that are successfully written into the parallel file system (PFS) at the sink end. Depending on the number of log files created for the whole dataset, we have classified our FT mechanisms into three different categories: file logger, transaction logger, and universal logger. Also, to address the space overhead, we have proposed different methods of populating the log files with the information of the successfully transferred objects. We have evaluated the data transfer performance and recovery time overhead of the proposed object-logging-based FT mechanisms on the LADS data transfer framework. Our experimental results reflect that FT mechanisms exhibit negligible overhead (<; 1%) with respect to the data transfer time. Yet, the fault recovery time is 10% higher than the total data transfer time at any fault point.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multicarrier Spread Spectrum Communications With Noncontiguous Subcarrier Bands for HF Skywave Links

Existing high-frequency (HF) radio platforms offer robust performance against the volatile HF propagation channel. However, the growing traffic across the band contests the reliability of these systems. While techniques to mitigate the effects of narrowband interference have been thoroughly explored, they are insufficient against wideband interference or when the transmission band is occupied by numerous scattered users. To improve reliability in these congested channel conditions, we propose a filter-bank based multicarrier spread-spectrum waveform with noncontiguous subcarrier bands. Using noncontiguous subcarrier bands enables the system to at once leverage the robustness of a wideband system while retaining the frequency agility of a narrowband system. In this study, we modify a filter-bank transmitter structure to accommodate noncontiguous subcarrier bands and consider several immediate impacts of this change, such as elevated peak-to-average-power ratios (PAPRs). A receiver architecture to process the noncontiguous spread-spectrum signal is also introduced, along with details regarding wideband channel estimation. Finally, we develop efficient transmitter and receiver structures to support practical system implementations. We conclude by comparing the performance of contiguous and noncontiguous systems through both simulation and over-the-air testing. The results show that the noncontiguous system remains robust in typical HF channels while significantly outperforming the contiguous system in congested spectral conditions.

(PAPR↗
DOE OSTI2017

Deep Learning on Operational Facility Data Related to Large-Scale Distributed Area Scientific Workflows

Abstract—Distributed computing platforms provide a robust mechanism to perform large-scale computations by splitting the task and data among multiple locations, possibly located thousands of miles apart geographically. This distribution of resources can lead to benefits such as redundancy of data, engagement with scientific teams that involve a diverse group of domain experts distributed spatially around the globe. It allows scientists to share their expertise and data with everyone and achieve insights by deploying collective intelligence of entire team. However, this distributed computing comes with its associated problems such as rampant duplication of file transfers increasing congestion, long job completion times, unexpected site crashing, suboptimal data transfer rates, unpredictable reliability in a time range, overshooting congestion, suboptimal usage of storage elements. In addition, each sub-system becomes a potential failure node that can trigger system wide disruptions.

Machine Learning, Provenance, Time Series, Semanti↗
DOE OSTI2012

Optimization of the hop-byte metric for effective topology aware mapping

Suitable mapping of processes to the nodes of a massively parallel machine can substantially improve communication performance by reducing network congestion. The hop-byte metric has been used as a measure of the quality of such a mapping by several recent works. Optimizing this metric is NP hard, and thus heuristics are applied. However, the heuristics proposed so far do not directly try to optimize this metric. Rather, they use some intuitive methods for reducing congestion and use the metric just to evaluate the quality of the mapping. In fact, heuristics intending to optimize other metrics too don't directly optimize for them, but, rather, use the metric to evaluate the results of the heuristic. In contrast, we pose the mapping problem with the hop-byte metric as a quadratic assignment problem and use a heuristic to directly optimize for this metric. We evaluate our approach on realistic node allocations obtained on the Kraken system at NICS. Our approach yields values for the metric that are up to 75% lower than the default mapping and 66 % lower than existing heuristics. However, the time taken to produce the mapping can be substantially more, which makes this suitable for somewhat static, though possibly irregular, communication patterns. We introduce new heuristics that reduce the time taken to be comparable to that of existing fast heuristics, while still producing mappings of higher quality than existing ones. We also use theoretical lower bounds to suggest that our mapping may be close to optimal, at least for medium sized problems. Consequently, our work can also provide insight into the tradeoff between mapping quality and time taken by other mapping heuristics.

Sudheer, C. D.↗
DOE OSTI2025

Implementing Directive-Based Deferred Execution for Effective Network Aggregation

Remote direct memory access technology provides an efficient mechanism for one-sided communication that can be leveraged to implement a distributed shared memory programming model. However, when applications generate large numbers of small, irregular messages, network congestion often arises. Existing solutions address this small message problem by facilitating message aggregation but typically require disruptive code transformations that detract from the algorithmic intent of applications, or can be limited by dependent operations on aggregated data between synchronisation points. A solution is to use a directive-assisted approach that enables compilers to transform code dependent on aggregated communication for deferred execution. This paper presents an algorithm that a compiler can use to implement and optimise deferred execution for code dependent on aggregated data, based on an "aggregation context" extension for the OpenSHMEM partitioned global address space library. This new capability addresses a key challenge of message aggregation, allowing its full potential to reduce network congestion and enhance programmability to be realised.

Welch, Aaron [ORNL]↗
DOE OSTI2024

Optimization of Dynamic Ride-Sharing by Considering User Preference Through Discount and Delay Tolerance

Dynamic ride-sharing (DRS) has been projected to be a key solution to lowering system-wide congestion. Despite recent development progress, demand studies for DRS suggest low levels of willingness for travelers to use such services. The disconnect between DRS system designs and user preferences limits the application impacts of DRS in the real world. Therefore, this paper aims to design a new DRS system by considering the user preferences of choices under different levels of services. In this study, an agent-based approach is used to model a fleet of shared vehicles that allows DRS. An optimization model is developed to match riders to vehicles while accounting for traveler delay and delay acceptance. Travelers are also dynamically issued predictive discounts to incentivize them to accept longer trip delays. Results show that the proposed approach can improve system efficiency by increasing average vehicle occupancy by up to 1.0 persons/trip and DRS acceptance up to 38.9% depending on fleet size. Additionally, congestion is eased through the decrease of empty vehicle miles traveled by up to 7.1%.

Paul, Joseph↗
DOE OSTI2025

Hierarchical Speed Planner for Automated Vehicles: A Framework for Lagrangian Variable Speed Limit in Mixed-Autonomy Traffic

Here, this article presents a novel hierarchical speed planning framework for variable speed limits in mixed-autonomy traffic environments, leveraging server-side macroscopic control and vehicle-side microscopic execution. The framework integrates real-time traffic state estimation (TSE) and reinforcement learning (RL)-based control to mitigate congestion and improve traffic flow. A TSE enhancement module combines macroscopic data from sources like INRIX with high-resolution observations from connected autonomous vehicles (CAVs), enabling predictive modeling to address latency and noise. The target speed design module employs kernel smoothing and a buffer zone strategy to optimize traffic density and flow around bottlenecks. The proposed system was validated in the largest open-road test to date with 100 CAVs, demonstrating an overall 8% traffic density decrease, with a specific decrease of 7% upstream, 10% downstream, and a 52% decrease during the congestion formation phase at bottlenecks.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2011

Analysis of Residential Demand Response and Double-Auction Markets

Demand response and dynamic pricing programs are expected to play increasing roles in the modern Smart Grid environment. While direct load control of end-use loads has existed for decades, price driven response programs are only beginning to be explored at the distribution level. These programs utilize a price signal as a means to control demand. Active markets allow customers to respond to fluctuations in wholesale electrical costs, but may not allow the utility to control demand. Transactive markets, utilizing distributed controllers and a centralized auction can be used to create an interactive system which can limit demand at key times on a distribution system, decreasing congestion. With the current proliferation of computing and communication resources, the ability now exists to create transactive demand response programs at the residential level. With the combination of automated bidding and response strategies coupled with education programs and customer response, emerging demand response programs have the ability to reduce utility demand and congestion in a more controlled manner. This paper will explore the effects of a residential double-auction market, utilizing transactive controllers, on the operation of an electric power distribution system.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2024

Beyond the Bridge: Contention-Based Covert and Side Channel Attacks on Multi-GPU Interconnect

Recently, high-speed interconnects like NVLink have become a standard integration in modern multi-GPU systems, serving as a crucial bridge between CPUs and GPUs. This study highlights the vulnerability of multi-GPU systems to covert and side-channel attacks arising from congestion on these interconnects. An adversary, operating without special permissions, can extract private information about a victim's activities by monitoring NVLink congestion. Specifically, we leverage this insight to develop a covert channel attack across two GPUs, achieving a respectable bandwidth of 33 Kbps. Additionally, we introduce a side-channel attack that allows attackers to fingerprint applications on a remote GPU by probing the shared NVLink interconnect. We underscore the urgent nature of the threats posed by these attacks and advocate for heightened awareness within both industry and academia to implement multi-GPU interconnects with enhanced security measures.

Zhang, Yicheng↗
DOE OSTI2023

Traffic Signal Optimization by Integrating Reinforcement Learning and Digital Twins

Machine learning (ML) methods, especially reinforcement learning (RL), have been widely considered for traffic signal optimization in intelligent transportation systems. Most of these ML methods are centralized, lacking in scalability and adaptability in large traffic networks. Further, it is challenging to train such ML models due to the lack of training platforms and/or the cost of deploying and training in a real traffic networks. This paper presents an approach for the integration of decentralized graph-based multi-agent reinforcement learning (DGMARL) with a Digital Twin (DT) to optimize traffic signals for the reduction of traffic congestion and network-wide fuel consumption related to stopping. Specifically, the DGMARL agents learn traffic state patterns and make decisions regarding traffic signal control with assistance from a Digital Twin module, which simulates and replicates the traffic behaviors of a real traffic network. The proposed approach was evaluated using PTV-Vissim [1], a microscopic traffic simulation platform. PTV-Vissim is also the simulation engine of the DT, enabling emulation and optimization of the traffic signals on the MLK Smart Corridor in Chattanooga, Tennessee. Compared to an actuated signal control baseline approach, experiment results show that Eco_PI, a developed performance measure capturing the impact of stops on fuel consumption, was reduced by 44.27% in a 24-hour and an average of 29.88% in a PM-peak-hour scenario.

Multi-Agent Reinforcement Learning, Digital Twin, ↗
DOE OSTI2019

Can I/O Variability Be Reduced on QoS-Less HPC Storage Systems?

For a production high-performance computing (HPC) system, where storage devices are shared between multiple applications and managed in a best effort manner, I/O contention is often a major problem. In this paper, we propose a balanced messaging-based re-routing in conjunction with throttling at the middleware level. This work tackles two key challenges that have not been fully resolved in the past: whether I/O variability can be reduced on a QoS-less HPC storage system, and how to design a runtime scheduling system that can scale up to a large amount of cores. The proposed scheme uses a two-level messaging system to re-route I/O requests to a less congested storage location so that write performance is improved, while limiting the impact on read by throttling re-routing. An analytical model is derived to guide the setup of optimal throttling factor. We thoroughly analyze the virtual messaging layer overhead and explore whether the in-transit buffering is effective in managing I/O variability. Contrary to the intuition, in-transit buffer cannot completely solve the problem. It can reduce the absolute variability but not the relative variability. The proposed scheme is verified against a synthetic benchmark as well as being used by production applications.

Huang, Dan↗
DOE OSTI2022

Joint Planning of Electricity Transmission and Hydrogen Transportation Networks

The abundance and uneven distribution of renewable energy might cause congestion and curtailment in electric power systems. Transmission expansions can potentially alleviate transmission congestion and reduce renewable energy curtailment. On the other hand, with the substantial cost reduction of electrolyzer technology and the continuing rise of hydrogen demand, converting surplus renewable energy to hydrogen provides synergistic benefits to power and hydrogen systems, but consequently requires joint planning of the two systems. To this end, we propose a joint planning approach for power transmission and hydrogen transportation networks to coordinately optimize the investment and operation of power and hydrogen infrastructure. In our proposed model, detailed truck routing, pipeline, and hydrogen storage are formulated to quantify the flexibility of hydrogen transportation system. A robust joint planning approach is also proposed to address various uncertainties from renewable energy, electric load, and hydrogen demand. Furthermore, our numerical simulations show that the proposed joint planning model can save the total system cost, reduce renewable energy curtailment, and increase the utilization level of transmission lines.

08 HYDROGEN↗
DOE OSTI2022

Network-Level Traffic Signal Cooperation: A Higher-Order Conflict Graph Approach

Traffic signal control and cooperation are extremely important to alleviate traffic congestion in a large traffic network. This study develops a higher-order conflict graph approach for network-wide traffic signal control and cooperation. A conflict graph is applied to model the traffic signal configurations, which identifies the conflict and unconflicted movements for each intersection. In conflict graph, the node represents each movement. The weight of each node can be defined as traffic volume, queue length, fuel consumption, or any weighted combinations of these measurements. The calculation of the optimal green light duration and green light sequence (for different movements) is equivalent to sequentially finding the maximum weight independent set (MWIS) in the conflict graph. The conflict graph also provides a uniform and efficient way to connect traffic signal operations among nearby intersections spatially. Then, we introduced the concept of the k -th order neighborhood to model the degree of connectivity between each movement to the movements at upstream or downstream intersections. The weight of each node in the higher-order conflict graph not only represents its own congestion level, but also relates to the traffic conditions of nearby intersections. Through this approach, the cooperation of multiple intersections can be realized by incorporating their spatial connectivity into conflict graph and solving the MWIS problem. A simulation network is built in SUMO to test the effectiveness of the proposed method. Results suggested that the proposed model outperformed other state-of-the-art signal control methods. Also, the scheme maintains good performance under varying traffic demands.

42 ENGINEERING↗
DOE OSTI2025

Throughput Measurements and Profile Analysis of Cloud Networks

Cloud networks utilize virtual connections to connect virtual machines distributed across cloud sites. They are increasingly deployed due to flexible provisioning using software and cost-effectiveness in not requiring to build physical network infrastructure. However, their extensive virtualization makes it unclear how well the established practices of conventional networks translate to them. Here, we study throughput measurements over a Google Cloud network using a matching hardware emulated conventional network, which provide production and exploratory conditions, respectively. The measurements span connections representing local, cross-continental and around the Earth distances. We study the effects of parallel flows, congestion control algorithms and retransmissions on the network throughput profile expressed as a function of RTT. We compare the throughput profile of Google Cloud network with those of emulated network under various loss conditions, including those too disruptive or expensive in the former. Our analysis based on the concave-convex shape and utilization-concavity coefficients of throughput profiles indicates an overall agreement of performance between the two networks, thereby justifying the use of conventional network emulations to analyze cloud networks. In terms of practical use, our study establishes that BBR and BBRv2 alpha TCP achieve higher throughput compared to loss-based congestion control algorithms under most network configurations, especially, under losses at large RTT.

Phanekham, Derek [Southern Methodist Univ., Dallas↗
DOE OSTI2025

Learning error distribution kernel‐enhanced neural network methodology for multi‐intersection signal control optimization

Traffic congestion has substantially induced significant mobility and energy inefficiency. Many research challenges are identified in traffic signal control and management associated with artificial intelligence (AI)-based models. For example, developing AI-driven dynamic traffic system models that accurately capture high-resolution traffic attributes and formulate robust control algorithms for traffic signal optimization is difficult. Additionally, uncertainties in traffic system modeling and control processes can further complicate traffic signal system controllability. To partially address these challenges, this study presents a novel, hybrid neural network model enhanced with a probability density function kernel shaping technique to formulate traffic system dynamics better and improve comprehensive traffic network modeling and control. The numerical experimental tests were conducted, and the results demonstrate that the proposed control approach outperforms the baseline control strategies and reduces overall average delays by 11.64% on average. By leveraging the capabilities of this innovative model, this study aims to address major challenges related to traffic congestion and energy inefficiency toward more effective and adaptable AI-based traffic control systems.

Wang, Hong [Oak Ridge National Laboratory (ORNL), ↗
DOE OSTI2018

Predictively Coordinated Vehicle Acceleration and Lane Selection Using Mixed Integer Programming

Autonomous vehicle technology provides the means to optimize motion planning beyond human capacity. In particular, the problem of navigating multi-lane traffic optimally for trip time, energy efficiency, and collision avoidance presents challenges beyond those of single-lane roadways. For example, the host vehicle must simultaneously track multiple obstacles, the drivable region is non-convex, and automated vehicles must obey social expectations. Furthermore, reactive decision-making may result in becoming stuck in an undesirable traffic position. This paper presents a fundamental approach to these problems using model predictive control with a mixed integer quadratic program at its core. Lateral and longitudinal movements are coordinated to avoid collisions, track a velocity and lane, and minimize acceleration. Vehicle-to-vehicle connectivity provides a preview of surrounding vehicles’ motion. Simulation results show a 79% reduction in congestion-induced travel time and an 80% decrease in congestion-induced fuel consumption compared to a rule-based approach.

Dollar, Robert Austin↗
DOE OSTI2016

A real-time path rating calculation tool powered by HPC

If transmission path ratings are determined in real time and optimized control methods can be implemented, congestion problems can be more effectively managed using the existing transmission assets, reducing congestion costs, avoiding capital expenditures for new physical assets, increasing revenues from the existing system, and maintaining reliability. In just one illustrative case, a BPA study has shown that a 1000-MW rating increase for a transmission path generates $15M in annual revenue, even if only 25% of the increased margin can be tapped for just 25% of the year.

Source record↗