Topic
Packet loss
About: Packet loss is a research topic. Over the lifetime, 21235 publications have been published within this topic receiving 302453 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is shown that CRDSA largely outperforms the classical lotted ALOHA (SA) technique in terms of throughput under equal packet loss ratio conditions, and can be easily integrated in systems equipped with digital burst demodulators.
Abstract: In this paper a new multiple access scheme dubbed contention resolution diversity slotted ALOHA (CRDSA) is introduced and its performance and implementation are thoroughly analyzed. The scheme combines diversity transmission of data bursts with efficient interference cancellation techniques. It is shown that CRDSA largely outperforms the classical lotted ALOHA (SA) technique in terms of throughput under equal packet loss ratio conditions (e.g. 17-fold improvement at packet loss ratio = 2 middot 10-2). CRDSA allows to boost the performance of random access (RA) channels in the return link of interactive satellite networks, making RA very efficient and providing low latency for the transmission of small size sparse packets. Implementation-wise it is shown that the CRDSA technique can be easily integrated in systems equipped with digital burst demodulators.
644 citations
TL;DR: AOMDV as discussed by the authors is an on-demand, multipath distance vector routing protocol for mobile ad hoc networks, which guarantees loop freedom and disjointness of alternate paths.
Abstract: We develop an on-demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.
625 citations
TL;DR: This work shows how current TCP implementations introduce unacceptably long pauses in communication during cellular handoffs, and proposes an end-to-end fast retransmission scheme that can reduce these pauses to levels more suitable for human interaction.
Abstract: We explore the performance of reliable data communication in mobile computing environments. Motion across wireless cell boundaries causes increased delays and packet losses while the network learns how to route data to a host's new location. Reliable transport protocols like TCP interpret these delays and losses as signs of network congestion. They consequently throttle their transmissions, further degrading performance. We quantify this degradation through measurements of protocol behavior in a wireless networking testbed. We show how current TCP implementations introduce unacceptably long pauses in communication during cellular handoffs (800 ms and longer), and propose an end-to-end fast retransmission scheme that can reduce these pauses to levels more suitable for human interaction (200 ms). Our work makes clear the need for reliable transport protocols to differentiate between motion-related and congestion-related packet losses and suggests how to adapt these protocols to perform better in mobile computing environments. >
607 citations
01 Apr 2001
TL;DR: It is found that an in-path monitor requires the definition of a reference de-jitter buffer implementation to estimate voice quality based upon observed transport measurements, and it is suggested that more studies are required, which evaluate the quality of various VoIP codecs in the presence of representative packet loss patterns.
Abstract: We describe a method for monitoring Voice over IP (VoIP) applications based upon a reduction of the ITU-T's E-Model to transport level, measurable quantities. In the process, 1) we identify the relevant transport level quantities, 2) we discuss the tradeoffs between placing the monitors within the VoIP gateways versus placement of the monitors within the transport path, and 3) we identify several areas where further work and consensus within the industry are required. We discover that the relevant transport level quantities are the delay, network packet loss and the decoder's de-jitter buffer packet loss. We find that an in-path monitor requires the definition of a reference de-jitter buffer implementation to estimate voice quality based upon observed transport measurements. Finally, we suggest that more studies are required, which evaluate the quality of various VoIP codecs in the presence of representative packet loss patterns.
603 citations
TL;DR: Stochastic Fair Blue is proposed and evaluated, a queue management algorithm which can identify and rate-limit nonresponsive flows using a very small amount of state information and is shown to perform significantly better than Red, both in terms of packet loss rates and buffer size requirements in the network.
Abstract: In order to stem the increasing packet loss rates caused by an exponential increase in network traffic, the IETF has been considering the deployment of active queue management techniques such as RED (random early detection) (see Floyd, S. and Jacobson, V., IEEE/ACM Trans. Networking, vol.1, p.397-413, 1993). While active queue management can potentially reduce packet loss rates in the Internet, we show that current techniques are ineffective in preventing high loss rates. The inherent problem with these algorithms is that they use queue lengths as the indicator of the severity of congestion. In light of this observation, a fundamentally different active queue management algorithm, called BLUE, is proposed, implemented and evaluated. BLUE uses packet loss and link idle events to manage congestion. Using both simulation and controlled experiments, BLUE is shown to perform significantly better than RED, both in terms of packet loss rates and buffer size requirements in the network. As an extension to BLUE, a novel technique based on Bloom filters (see Bloom, B., Commun. ACM, vol.13, no.7, p.422-6, 1970) is described for enforcing fairness among a large number of flows. In particular, we propose and evaluate stochastic fair BLUE (SFB), a queue management algorithm which can identify and rate-limit nonresponsive flows using a very small amount of state information.
587 citations