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.

SourceResearch connectionFrom yearThrough year

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

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1993

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↗

NASA NTRS2006

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↗

NASA NTRS2001

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↗

NASA NTRS2009

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.↗

NASA NTRS1993

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.↗

NASA NTRS1983

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.↗

NASA NTRS1987

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.↗

NASA NTRS1991

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.↗

NASA NTRS1991

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.↗

NASA NTRS1992

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↗

NASA NTRS1996

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.↗

NASA NTRS1994

Regular Topologies for Gigabit Wide-Area Networks

In general terms, this project aimed at the analysis and design of techniques for very high-speed networking. The formal objectives of the project were to: (1) Identify switch and network technologies for wide-area networks that interconnect a large number of users and can provide individual data paths at gigabit/s rates; (2) Quantitatively evaluate and compare existing and proposed architectures and protocols, identify their strength and growth potentials, and ascertain the compatibility of competing technologies; and (3) Propose new approaches to existing architectures and protocols, and identify opportunities for research to overcome deficiencies and enhance performance. The project was organized into two parts: 1. The design, analysis, and specification of techniques and protocols for very-high-speed network environments. In this part, SRI has focused on several key high-speed networking areas, including Forward Error Control (FEC) for high-speed networks in which data distortion is the result of packet loss, and the distribution of broadband, real-time traffic in multiple user sessions. 2. Congestion Avoidance Testbed Experiment (CATE). This part of the project was done within the framework of the DARTnet experimental T1 national network. The aim of the work was to advance the state of the art in benchmarking DARTnet's performance and traffic control by developing support tools for network experimentation, by designing benchmarks that allow various algorithms to be meaningfully compared, and by investigating new queueing techniques that better satisfy the needs of best-effort and reserved-resource traffic. This document is the final technical report describing the results obtained by SRI under this project. The report consists of three volumes: Volume 1 contains a technical description of the network techniques developed by SRI in the areas of FEC and multicast of real-time traffic. Volume 2 describes the work performed under CATE. Volume 3 contains the source code of all software developed under CATE.

Shacham, Nachum↗

NASA NTRS2001

Air Traffic Control Improvement Using Prioritized CSMA

Version 7 simulations of the industry-standard network simulation software "OPNET" are presented of two applications of the Aeronautical Telecommunications Network (ATN), Controller Pilot Data Link Communications (CPDLC) and Automatic Dependent Surveillance-Broadcast mode (ADS-B), over VHF Data Link mode 2 (VDL-2). Communication is modeled for air traffic between just three cities. All aircraft are assumed to have the same equipage. The simulation involves Air Traffic Control (ATC) ground stations and 105 aircraft taking off, flying realistic free-flight trajectories, and landing in a 24-hr period. All communication is modeled as unreliable. Collision-less, prioritized carrier sense multiple access (CSMA) is successfully tested. The statistics presented include latency, queue length, and packet loss. This research may show that a communications system simpler than the currently accepted standard envisioned may not only suffice, but also surpass performance of the standard at a lower cost of deployment.

Robinson, Daryl C.↗

NASA NTRS2001

CSMA Versus Prioritized CSMA for Air-Traffic-Control Improvement

OPNET version 7.0 simulations are presented involving an important application of the Aeronautical Telecommunications Network (ATN), Controller Pilot Data Link Communications (CPDLC) over the Very High Frequency Data Link, Mode 2 (VDL-2). Communication is modeled for essentially all incoming and outgoing nonstop air-traffic for just three United States cities: Cleveland, Cincinnati, and Detroit. There are 32 airports in the simulation, 29 of which are either sources or destinations for the air-traffic of the aforementioned three airports. The simulation involves 111 Air Traffic Control (ATC) ground stations, and 1,235 equally equipped aircraft-taking off, flying realistic free-flight trajectories, and landing in a 24-hr period. Collisionless, Prioritized Carrier Sense Multiple Access (CSMA) is successfully tested and compared with the traditional CSMA typically associated with VDL-2. The performance measures include latency, throughput, and packet loss. As expected, Prioritized CSMA is much quicker and more efficient than traditional CSMA. These simulation results show the potency of Prioritized CSMA for implementing low latency, high throughput, and efficient connectivity.

Robinson, Daryl C.↗

NASA NTRS2003

The Imager for Mars Pathfinder Insurance Pan

The Imager for Mars Pathfinder (IMP) obtained a full panorama of the Sagan Memorial Station landing site on Sol 2, before the IMP mast was deployed. The images in this panorama were taken in 4 filters (including stereo) and losslessly compressed to provide a high-quality multispectral survey of the landing site even if the IMP mast did not successfully deploy; this data set was therefore called the Insurance Pan. It was completed late in the afternoon of Sol 2, just before the IMP mast was (successfully) deployed. The data were stored in memory and returned to Earth after it became clear that downlink rates were higher than expected. The Insurance Pan horizontal (azimuth) coverage is nearly complete, with gaps caused by pointing errors and data packet losses. Stereo data were acquired in the blue (445 nm) filter, as well as right-eye green (531 nm), orange (600 nm), and near-infrared (752 nm) data.

K E Herkenhoff↗

NASA NTRS1998

Scalability Analysis and Use of Compression at the Goddard DAAC and End-to-End MODIS Transfers

The goal of this task is to analyze the performance of single and multiple FTP transfer between SCF's and the Goddard DAAC. We developed an analytic model to compute the performance of FTP sessions as a function of various key parameters, implemented the model as a program called FTP Analyzer, and carried out validations with real data obtained by running single and multiple FTP transfer between GSFC and the Miami SCF. The input parameters to the model include the mix to FTP sessions (scenario), and for each FTP session, the file size. The network parameters include the round trip time, packet loss rate, the limiting bandwidth of the network connecting the SCF to a DAAC, TCP's basic timeout, TCP's Maximum Segment Size, and TCP's Maximum Receiver's Window Size. The modeling approach used consisted of modeling TCP's overall throughput, computing TCP's delay per FTP transfer, and then solving a queuing network model that includes the FTP clients and servers.

Menasce, Daniel A.↗

NASA NTRS2005

Dual Purpose Simulation: New Data Link Test and Comparison With VDL-2

While the results of this paper are similar to those of previous research, in this paper technical difficulties present there are eliminated, producing better results, enabling one to more readily see the benefits of Prioritized CSMA (PCSMA). A new analysis section also helps to generalize this research so that it is not limited to exploration of the new concept of PCSMA. Commercially available network simulation software, OPNET version 7.0, simulations are presented involving an important application of the Aeronautical Telecommunications Network (ATN), Controller Pilot Data Link Communications (CPDLC) over the Very High Frequency Data Link Mode 2 (VDL-2). Communication is modeled for essentially all incoming and outgoing nonstop air traffic for just three United States cities: Cleveland, Cincinnati, and Detroit. The simulation involves 111 Air Traffic Control (ATC) ground stations, 32 airports distributed throughout the U.S., which are either sources or destinations for the air traffic landing or departing from the three cities, and also 1,235 equally equipped aircraft taking off, flying realistic free-flight trajectories, and landing in a 24-hr period. Collision-less PCSMA is successfully tested and compared with the traditional CSMA typically associated with VDL- 2. The performance measures include latency, throughput, and packet loss. As expected, PCSMA is much quicker and more efficient than traditional CSMA. These simulation results show the potency of PCSMA for implementing low latency, high throughput and efficient connectivity. Moreover, since PCSMA outperforms traditional CSMA, by simulating with it, we can determine the limits of performance beyond which traditional CSMA may not pass. We are testing a new and better data link that could replace CSMA with relative ease. Work is underway to drastically expand the number of flights to make the simulation more representative of the National Aerospace System.

Robinson, Daryl C.↗

NASA NTRS2005

Wireless Local Area Network Performance Inside Aircraft Passenger Cabins

An examination of IEEE 802.11 wireless network performance within an aircraft fuselage is performed. This examination measured the propagated RF power along the length of the fuselage, and the associated network performance: the link speed, total throughput, and packet losses and errors. A total of four airplanes: one single-aisle and three twin-aisle airplanes were tested with 802.11a, 802.11b, and 802.11g networks.

Whetten, Frank L.↗