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
28 Mar 2000
TL;DR: In this paper, the authors consider the problem of joint source/channel coding of real-time sources, such as audio and video, for the purpose of multicasting over the Internet.
Abstract: We consider the problem of joint source/channel coding of real-time sources, such as audio and video, for the purpose of multicasting over the Internet. The sender injects into the network multiple source layers and multiple channel (parity) layers, some of which are delayed relative to the source. Each receiver subscribes to the number of source layers and the number of channel layers that optimizes the source-channel rate allocation for that receiver's available bandwidth and packet loss probability. We augment this layered FEC system with layered ARQ. Although feedback is normally problematic in broadcast situations, ARQ is simulated by having the receivers subscribe and unsubscribe to the delayed channel coding layers to receive missing information. This pseudo-ARQ scheme avoids an implosion of repeat requests at the sender, and is scalable to an unlimited number of receivers. We show gains of up to 18 dB on channels with 20% loss over systems without error control, and additional gains of up to 13 dB when FEC is augmented by pseudo-ARQ in a hybrid system. The hybrid system is controlled by an optimal policy for a Markov decision process.
105 citations
29 Mar 1999
TL;DR: An algorithm that assigns unequal amounts of forward error correction to progressive data so as to provide graceful degradation as packet losses increase is presented, finding that for an exponential packet loss model, good image quality can be obtained, even when 40% of transmitted packets are lost.
Abstract: We present an algorithm that assigns unequal amounts of forward error correction to progressive data so as to provide graceful degradation as packet losses increase. We use the SPIHT coder to compress images in this work, but our algorithm can protect any progressive compression scheme. The algorithm can also use almost any function as a model of packet loss conditions. We find that for an exponential packet loss model with a mean of 20% and a total rate of 0.2 bpp, good image quality can be obtained, even when 40% of transmitted packets are lost.
104 citations
Patent•
25 Jun 1992
TL;DR: In this article, a technique for reducing latencies in bridge operation, by facilitating cut-through transmission of a receive data packet while the packet is still being received, but without the need for starting or ending delimiters, or packet lengths, in the packet data.
Abstract: A technique for reducing latencies in bridge operation, by facilitating cut-through transmission of a receive data packet while the packet is still being received, but without the need for starting or ending delimiters,or packet lengths, in the packet data. The technique can be applied to packets inbound from a network, packets outbound to a network, or packets being looped back to a client to which the bridge is connected. In the technique of the invention, each received packet is stored in a buffer memory and a count is maintained of the number of bits in the received packet. A transmit operation is started as soon as possible, preferably while the packet is still being received, and bytes are retrieved from the buffer memory for transmission. The transmit operation is terminated when a transmit byte count reaches the packet length as determined by the receive byte count. For cut-through operations, the transmit operation is started without knowledge of the packet length, but the packet length is made available to the transmit operation upon completion of the receive operation. For store-and-forward operations, the packet length is stored with the packet in the buffer memory, and retrieved for use in the transmit operation.
104 citations
15 Oct 2007
TL;DR: A congestion-aware routing protocol is proposed which uses a metric incorporating data-rate, MAC overhead, and buffer delay to combat congestion to make mobile ad hoc networks robust and adaptive to congestion.
Abstract: Congestion in mobile ad hoc networks leads to transmission delays and packet loss, and causes wastage of time and energy on recovery. Routing protocols which are adaptive to the congestion status of a mobile ad hoc network can greatly improve the network performance. In this paper, we propose a congestion-aware routing protocol for mobile ad hoc networks which uses a metric incorporating data-rate, MAC overhead, and buffer delay to combat congestion. This metric is used, together with the avoidance of mismatched link data-rate routes, to make mobile ad hoc networks robust and adaptive to congestion.
104 citations
11 Jun 1989
TL;DR: The effect of speedup (L) on packet loss probability and average transmission delay in the case of an arbitrary number L, such that 1
Abstract: The nonblocking packet switch under consideration has N inputs and N outputs and operates L times as fast as the input and output trunks. The effect of speedup (L) on packet loss probability and average transmission delay in the case of an arbitrary number L, such that 1 >
104 citations