Search NASA⌕ Search

SEARCH · Search NASA

Results for “packet loss”

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 19 records

Fast simulation of packet loss rates in a shared buffer communications switch

This paper describes an efficient technique for estimating, via simulation, the probability of buffer overflows in a queueing model that arises in the analysis of ATM (Asynchronous Transfer Mode) communication switches. There are multiple streams of (autocorrelated) traffic feeding the switch that has a buffer of finite capacity. Each stream is designated as either being of high or low priority. When the queue length reaches a certain threshold, only high priority packets are admitted to the switch's buffer. The problem is to estimate the loss rate of high priority packets. An asymptotically optimal importance sampling approach is developed for this rare event simulation problem. In this approach, the importance sampling is done in two distinct phases. In the first phase, an importance sampling change of measure is used to bring the queue length up to the threshold at which low priority packets get rejected. In the second phase, a different importance sampling change of measure is used to move the queue length from the threshold to the buffer capacity.

Chang, Cheng-Shang↗

General Solution for Theoretical Packet Data Loss Rate

Communications systems which transfer blocks ("frames") of data must use a marker ("frame synchronization pattern") for identifying where a block begins. A technique ("frame synchronization strategy") is used to locate the start of each frame and maintain synchronization as additional blocks are processed. A device which strips out the frame synchronization pattern [FSP] and provides an "end of frame" pulse is called a frame synchronizer. As clock and data errors are introduced into the system, the start-of-block marker becomes displaced and/or corrupted. The capability of the frame synchronizer to stay locked to the pattern under these conditions is a figure of merit for the frame synchronization strategy. It is important to select a strategy which will stay locked nearly all the time at bit error rates where the data is usable. ("Bit error rate" [BER] is the fraction of binary bits which are inverted by passage through a communication system.) The fraction of frames that are discarded because the frame synchronizer is not locked is called "Percent Data Loss" or "Packet Data Loss rate" [PDL]. A general approach for accurately predicting PDL given BER was developed in Theoretical Percent Data Loss Calculation and Measurement Accuracy, T. P. Kelly, LESC-30554, December 1992. Kelly gave a solution in terms of matrix equations, and only addressed "level" channel encoding. This paper goes on to give a closed-form polynomial solution for the most common class of frame synchronizer strategies, and will also address "mark" and "space" (differential) channel encoding, and burst error environments. The paper is divided into four sections and follows a logically ordered presentation, with results developed before they are evaluated. However, most readers will derive the greatest benefit from this paper by treating the results as reference material. The result developed for differential encoding can be extended to other applications (like block codes) where the probability is needed that a block contains only a certain number of errors.

Lansdowne, Chatwin↗

Improving Explicit Congestion Notification with the Mark-Front Strategy

Delivering congestion signals is essential to the performance of networks. Current TCP/IP networks use packet losses to signal congestion. Packet losses not only reduces TCP performance, but also adds large delay. Explicit Congestion Notification (ECN) delivers a faster indication of congestion and has better performance. However, current ECN implementations mark the packet from the tail of the queue. In this paper, we propose the mark-front strategy to send an even faster congestion signal. We show that mark-front strategy reduces buffer size requirement, improves link efficiency and provides better fairness among users. Simulation results that verify our analysis are also presented.

Liu, Chunlei↗

Assessment of the 802.11g Wireless Protocol for Lunar Surface Communications

Future lunar surface missions supporting the NASA Vision for Space Exploration will rely on wireless networks to transmit voice and data. The ad hoc network architecture is of particular interest since it does not require a complex infrastructure. In this report, we looked at data performance over an ad hoc network with varying distances between Apple AirPort wireless cards. We developed a testing program to transmit data packets at precise times and then monitored the receive time to characterize connection delay, packet loss, and data rate. Best results were received for wireless links of less than 75 ft, and marginally acceptable (25-percent) packet loss was received at 150 ft. It is likely that better results will be obtained on the lunar surface because of reduced radiofrequency interference; however, higher power transmitters or receivers will be needed for significant performance gains.

Chelmins, David T.↗

Development of a Practical Secondary Control for Hardware Microgrids

Practical, vendor-agnostic interoperability guidelines for the secondary control architecture of microgrids (MGs) with multiple grid-forming (GFM) inverter-based resources (IBRs) have not yet been developed. Therefore, this paper proposes a generic and vendor-agnostic secondary control architecture that operates with all GFM IBRs and synchronous generators. This secondary control does not require the use of additional measurement devices in the MG and utilizes the inherent communication systems of the GFM units, such as Modbus TCP/IP. The practical challenges of Modbus registers, such as packet loss and quantization error, and their detrimental impacts on secondary control actions are investigated. The proposed three-stage modification for any secondary control architecture to mitigate these impacts includes: 1) averaging the data read, 2) situational event-triggering of the controller, and 3) finite iteration of the controlling action. The proposed method is validated using a 3-..phi.., 480 V, 60 Hz, 500 kVA laboratory hardware microgrid with commercial two GFM IBRs and one diesel generator. The experimental results corroborates the fact the proposed modification in the secondary control architecture is advantageous for practical usage under erroneous measurements.

communication systems↗

On-board closed-loop congestion control for satellite based packet switching networks

NASA LeRC is currently investigating a satellite architecture that incorporates on-board packet switching capability. Because of the statistical nature of packet switching, arrival traffic may fluctuate and thus it is necessary to integrate congestion control mechanism as part of the on-board processing unit. This study focuses on the closed-loop reactive control. We investigate the impact of the long propagation delay on the performance and propose a scheme to overcome the problem. The scheme uses a global feedback signal to regulate the packet arrival rate of ground stations. In this scheme, the satellite continuously broadcasts the status of its output buffer and the ground stations respond by selectively discarding packets or by tagging the excessive packets as low-priority. The two schemes are evaluated by theoretical queuing analysis and simulation. The former is used to analyze the simplified model and to determine the basic trends and bounds, and the later is used to assess the performance of a more realistic system and to evaluate the effectiveness of more sophisticated control schemes. The results show that the long propagation delay makes the closed-loop congestion control less responsive. The broadcasted information can only be used to extract statistical information. The discarding scheme needs carefully-chosen status information and reduction function, and normally requires a significant amount of ground discarding to reduce the on-board packet loss probability. The tagging scheme is more effective since it tolerates more uncertainties and allows a larger margin of error in status information. It can protect the high-priority packets from excessive loss and fully utilize the downlink bandwidth at the same time.

Chu, Pong P.↗

A Secondary Control Framework for Microgrid Interoperability With Vendor-Agnostic Grid-Forming Units: Design, Implementation, and Demonstration via Large-Scale Hardware Setup

The reliable operation of islanded microgrids increasingly depends on secondary controls that restore voltage and frequency to nominal values and ensure accurate active and reactive power sharing. Centralized secondary control architectures achieve high accuracy through global coordination at the cost of single-point failures and limited scalability compared with decentralized/distributed approaches. But a critical gap remains in addressing the interoperability and vendor-agnostic operation of secondary controls in real-world microgrids where heterogeneous diesel generator(s) and grid-forming (GFM) inverter(s) from multiple manufacturers always coexist. Practical and vendor-agnostic interoperability guidelines for the secondary control architecture of microgrids with multiple GFM units have not yet been developed; therefore, this paper proposes an interoperable and vendor-agnostic secondary control framework that operates seamlessly across GFM units from different vendors without relying on proprietary controls and protocols, hardware, or lock-ins. The framework leverages existing communication infrastructures (e.g., Modbus TCP/IP) to enable cost-effective deployment while addressing practical challenges, such as packet loss and quantization errors. Mitigation strategies-including data averaging, situational event-triggered control, and finite-iteration execution-are introduced to enhance reliability under real-world conditions. A generalized modeling and design framework is also presented, supported by robustness analysis to demonstrate independence from vendor-specific implementations. The proposed framework is validated through a large-scale hardware demonstration using a 3-$\phi$, 480-V, 60-Hz, 713-kVA laboratory hardware microgrid involving a heterogeneous diesel generator and multiple GFM inverters, showcasing its effectiveness in achieving stable voltage and frequency restoration and accurate power sharing under practical constraints. The results highlight the framework's potential as a scalable and practical solution for next-generation microgrids requiring openness, standard framework, and interoperability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Consensus-Based Control and Optimization of Power System Inertia

The integration of distributed energy resources (DERs), such as solar, wind, and energy storage systems, into power grids through inverter-based resources reduces power system inertia, leading to faster frequency dynamics and potential grid instability. To address this challenge, this paper proposes a distributed, consensus-based approach for the real-time control and optimization of inertia sources (synchronous generators and/or DERs) during system disturbances, enhancing both system stability and economic performance. The distributed control and optimization approach assumes each inertia source exchanges information solely with its neighbor ones, making it easily scalable to large power grid networks. The impacts of the communication connectivity among the inertia sources as well as their generation capacity limits on the distributed approach are investigated. We also demonstrate the approach’s robustness in scenarios involving communication time delays and packet losses, validating its effectiveness through numerical simulations on a 4-bus test system and a two-area 8-bus test system.

Power system inertia↗

Distributed Inertia Management Under Communication Constraints

This paper presents a framework for distributed inertia management based on consensus algorithm. We propose a methodology to achieve optimal operation of inertia sources such as distributed energy resources (DERs) and synchronous generators in real time. Additionally, we analyze the algorithm under communication constraints and evaluate its robustness under scenarios involving communication time delays and packet losses. The proposed approach is validated via simulations on a 4-node system test feeder, demonstrating its effectiveness and resilience.

Yadav, Ajay [ORNL] (ORCID:000000016111881X)↗

JANUS: Resilient and Adaptive Data Transmission for Enabling Timely and Efficient Cross-Facility Scientific Workflows

In modern science, the growing complexity of large-scale scientific projects has led to an increasing reliance on cross-facility scientific workflows, where resources and expertise from multiple institutions and geographic locations are leveraged to accelerate scientific discovery. These workflows often require transmitting huge amounts of scientific data through wide-area networks. Although high-speed networks like ESnet and transfer services such as Globus have improved data mobility, several challenges remain. The sheer volume of data can overwhelm network bandwidth, widely used transport protocols such as TCP suffer from inefficiencies due to retransmissions triggered by packet loss, and existing fault-tolerance mechanisms like erasure coding introduce substantial overhead. In this paper, we propose Janus, a resilient and adaptable data transmission approach designed for cross-facility scientific workflows. Unlike traditional TCP-based methods, Janus leverages UDP, integrates erasure coding for fault tolerance, and combines it with error-bounded lossy compression to reduce overhead. This novel design allows users to balance data transmission time and accuracy, optimizing transfer performance based on specific scientific requirements. Additionally, Janus dynamically adjusts erasure coding parameters in response to real-time network conditions, ensuring efficient data transfers even in fluctuating environments. We develop optimization models for determining ideal configurations and implement adaptive data transfer protocols to enhance reliability. Through extensive simulations and real-network experiments, we demonstrate that Janus significantly improves transfer efficiency while maintaining data fidelity.

Esaulov, Vladislav [Georgia State University, Atla↗

Precision Time Protocol Synchronization Under Network Impairments

This bulletin examines how network anomalies disrupt Precision Time Protocol synchronization on long terrestrial links used for grid timing. Using a CAST testbed with emulated impairments, we measured delay, offset, and time interval error while monitoring packet rates. Symmetric delays did not perturb synchronization, whereas asymmetric delays produced false offsets; jitters were largely filtered out, but they delayed synchronization recovery; moderate packet loss was tolerated, while severe loss forced holdover and loss of synchronization.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Best Practices for Grid Communications

As the grid evolves, the communications architecture will need to evolve with it. That architecture affords a structured means by which the evolving complexities of the modern electric grid can be managed. This document provides best practices that can be implemented in the grid of today and evolve towards the grid and grid architecture of the future. The evolving grid and its control communications increasingly rely on commercial communications providers and a variety of technologies, from wireless (e.g., 5G, microwave, Wi-Fi) to wireline (fiber, copper) to radio communications (P25, other repeater-based systems), and all these communications systems rely on electric power. A reliable and resilient grid must account for this complex set of interdependencies in its planning activities, especially those involving restoration and recovery. The participation of all relevant parties in both planning and exercising of plans can prevent unexpected conditions that impede the reliable operation and recovery of the grid. Best practices for grid communications include using a Network Management System to document the operational state, define and monitor baselines, detect changes, and accelerate response to abnormalities. If transitioning from SONET to IP/packet-based systems, translating grid requirements into communications requirements for latency, bandwidth and throughput, IP packet delay variation, packet loss, and availability should inform and drive technology planning and selection as well as that communication system’s Quality of Service (QoS) policies and Service Level Agreements (SLAs). Secure and reliable timing is another key component of a reliable and resilient grid that can operate through adverse events. A trusted internal NTP configuration, an integrated and diverse timing delivery system, optimizing the timing architecture based on the transport technologies of the communications system, and using established standards can deliver the level of timing accuracy required by a range of time-sensitive power system applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On the design of prioritized multiplexing systems

Systems in which many data sources are multiplexed over a single communication channel are considered. Data from all the sources are generated in fixed-length packets, and are stored in a common buffer with finite capacity. Packets overflowed or removed from the buffer prior to transmission are lost. The system performance measure is the set of packet loss probabilities associated with the sources. Queueing disciplines vary depending on the stringency of prioritization and the utilization of system resources. The set of all possible performances is characterized as the set of all queueing disciplines is spanned. Whether a given performance is possible can be deduced. Strategies that achieve the minimum overall loss probability are identified. The extreme disciplines are specified, and their performances are calculable by means of a given algorithm.

Clare, L. P.↗

Performance boundaries for prioritized multiplexing systems

Systems in which many data sources are multiplexed over a single communication channel are considered. Data from all the sources are generated in fixed-length packets and are stored in a common buffer with finite capacity. Packets that overflowed or were removed from the buffer prior to transmission are lost. The system performance measure is the set of packet loss probabilities associated with the sources. Queueing disciplines vary depending on the stringency of prioritization and the utilization of the system resources. The set of all possible performances is characterized as the set of all queueing disciplines is spanned. Whether a given performance is possible can be deduced. Strategies that achieve the minimum overall loss probability are identified. The extreme disciplines are specified, and their performances are calculable by means of a given algorithm.

Clare, Loren P.↗

A robust low-rate coding scheme for packet video

Due to the rapidly evolving field of image processing and networking, video information promises to be an important part of telecommunication systems. Although up to now video transmission has been transported mainly over circuit-switched networks, it is likely that packet-switched networks will dominate the communication world in the near future. Asynchronous transfer mode (ATM) techniques in broadband-ISDN can provide a flexible, independent and high performance environment for video communication. For this paper, the network simulator was used only as a channel in this simulation. Mixture blocking coding with progressive transmission (MBCPT) has been investigated for use over packet networks and has been found to provide high compression rate with good visual performance, robustness to packet loss, tractable integration with network mechanics and simplicity in parallel implementation.

Chen, Y. C.↗

A robust coding scheme for packet video

We present a layered packet video coding algorithm based on a progressive transmission scheme. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

Chen, Y. C.↗

A robust coding scheme for packet video

A layered packet video coding algorithm based on a progressive transmission scheme is presented. The algorithm provides good compression and can handle significant packet loss with graceful degradation in the reconstruction sequence. Simulation results for various conditions are presented.

Chen, Yun-Chung↗

Achieving High Throughput for Data Transfer over ATM Networks

File-transfer rates for ftp are often reported to be relatively slow, compared to the raw bandwidth available in emerging gigabit networks. While a major bottleneck is disk I/O, protocol issues impact performance as well. Ftp was developed and optimized for use over the TCP/IP protocol stack of the Internet. However, TCP has been shown to run inefficiently over ATM. In an effort to maximize network throughput, data-transfer protocols can be developed to run over UDP or directly over IP, rather than over TCP. If error-free transmission is required, techniques for achieving reliable transmission can be included as part of the transfer protocol. However, selected image-processing applications can tolerate a low level of errors in images that are transmitted over a network. In this paper we report on experimental work to develop a high-throughput protocol for unreliable data transfer over ATM networks. We attempt to maximize throughput by keeping the communications pipe full, but still keep packet loss under five percent. We use the Bay Area Gigabit Network Testbed as our experimental platform.

Johnson, Marjory J.↗