scispace - formally typeset
Search or ask a question
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
More filters
Proceedings ArticleDOI
08 Dec 2008
TL;DR: CARS, a novel context-aware rate selection algorithm that makes use of context information to systematically address the above challenges, while maximizing the link throughput, is designed, implemented and evaluated.
Abstract: Traffic querying, road sensing and mobile content delivery are emerging application domains for vehicular networks whose performance depends on the throughput these networks can sustain. Rate adaptation is one of the key mechanisms at the link layer that determine this performance. Rate adaptation in vehicular networks faces the following key challenges: (1) due to the rapid variations of the link quality caused by fading and mobility at vehicular speeds, the transmission rate must adapt fast in order to be effective, (2) during infrequent and bursty transmission, the rate adaptation scheme must be able to estimate the link quality with few or no packets transmitted in the estimation window, (3) the rate adaptation scheme must distinguish losses due to environment from those due to hidden-station induced collision. Our extensive outdoor experiments show that the existing rate adaptation schemes for 802.11 wireless networks under utilize the link capacity in vehicular environments. In this paper, we design, implement and evaluate CARS, a novel context-aware rate selection algorithm that makes use of context information (e.g. vehicle speed and distance from neighbor) to systematically address the above challenges, while maximizing the link throughput. Our experimental evaluation in real outdoor vehicular environments with different mobility scenarios shows that CARS adapts to changing link conditions at high vehicular speeds faster than existing rate-adaptation algorithms. Our scheme achieves significantly higher throughput, up to 79%, in all the tested scenarios, and is robust to packet loss due to collisions, improving the throughput by up to 256% in the presence of hidden stations.

114 citations

Patent
Xiang Li1, Jing Wu1, Shiduan Cheng1, Jian Ma1
14 Jun 2001
TL;DR: In this article, a new Fast Recovery Plus (FR+) mechanism is proposed for wireless and/or mobile network applications to avoid network congestion in a TCP/IP packet-switched network.
Abstract: A new Fast Recovery Plus (FR+) mechanism, and associated method, for wireless and/or mobile network applications to avoid network congestion in a TCP/IP packet-switched network. A method of flow control and congestion avoidance congestion in a network determining, at the source node, if packet loss is due to transmission error; and if the packet loss is due to the transmission error, setting, at the source node, the slow start threshold Ssthresh to Max (CWND, (Ssthresh + CWND)/2), wherein CWND and Ssthresh exhibit values recorded, when the packet lost was detected.

113 citations

Proceedings ArticleDOI
06 Jul 2001
TL;DR: It is proved that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm, and the competitive ratio of any online algorithm for a uniform bounded delay buffer is bounded away from 1, independent of the delay size.
Abstract: We consider two types of buffering policies that are used in network switches supporting QoS (Quality of Service). In the FIFO type, packets must be released in the order they arrive; the difficulty in this case is the limited buffer space. In the bounded-delay type, each packet has a maximum delay time by which it must be released, or otherwise it is lost. We study the cases where the incoming streams overload the buffers, resulting in packet loss. In our model, each packet has an intrinsic value; the goal is to maximize the total value of packets transmittedOur main contribution is a thorough investigation of the natural greedy algorithms in various models. For the FIFO model we prove tight bounds on the competitive ratio of the greedy algorithm that discards the packets with the lowest value. We also prove that the greedy algorithm that drops the earliest packets among all low-value packets is the best greedy algorithm. This algorithm can be as much as 1.5 times better than the standard tail-drop policy, that drops the latest packets.In the bounded delay model we show that the competitive ratio of any online algorithm for a uniform bounded delay buffer is bounded away from 1, independent of the delay size. We analyze the greedy algorithm in the general case and in three special cases: delay bound 2; link bandwidth 1; and only two possible packet values.Finally, we consider the off-line scenario. We give efficient optimal algorithms and study the relation between the bounded-delay and FIFO models in this case.

113 citations

Journal ArticleDOI
TL;DR: TC-QS (Quick Start) from the TCP protocol control is put forward in this paper in order to improve the performance of congestion control mechanism.
Abstract: With the development of Internet, various kinds of new applications appear constantly. They all have high requirements to the time delay, throughput, especially strong real-time applications such as mobile monitoring, video calls. The satellite network in Navigation Satellite System, which is necessary for the mobile monitoring, has many disadvantages such as asymmetric bandwidth, unstable network, high bit error rate and so on. This is a new challenge to the existing congestion control method. In order to improve the performance of congestion control mechanism, we put forward TCP-QS (Quick Start) from the TCP protocol control in this paper. TCP-QS algorithm mainly optimize the slow start stage. At the beginning of the connection, the value of parameter cwnd is set as a larger value according to the detected network bandwidth in which way, the time of the slow start stage is shortened during the transmission, and is adjusted the value of parameter ssthresh dynamically according to the change of network. When packet loss occurs, it takes different methods according to the different reasons.

113 citations

Patent
16 Feb 2001
TL;DR: In this paper, the authors proposed a path diversity transmission system for reliable video communication over lossy packet networks such as the Internet, where the system includes at least two jointly designed subsystems: (1) multiple state video coding system and (2) path-diversity transmission system.
Abstract: Video communication over lossy packet networks such as the Internet is hampered by limited bandwidth and packet loss. The present invention provides a system for providing reliable video communication over these networks, where the system includes at least two jointly designed subsystems: (1) multiple state video coding system and (2) path diversity transmission system. Multiple state video coding combats the problem of error propagation that results from packet loss by coding the video into multiple independently decodable streams, each with its own prediction process and state. If one stream is lost the other streams can still be decoded to produce usable video, and furthermore, the correctly received streams provide bidirectional (i.e., previous and future) information that enables improved state recovery for the corrupted stream. The path diversity transmission system explicitly sends different subsets of packets over different paths, as opposed to the prior art approaches where the packets proceed along a single path. By explicitly sending different subsets of packets over different paths, the path diversity transmission system enables the end-to-end video application to effectively see an average path behavior, which is referred to herein as path diversity. Generally, seeing this average path behavior provides better performance than seeing the behavior of any individual random path. The resulting path diversity provides the multiple state video decoder with an appropriate virtual channel to assist in recovering from lost packets, and can also simplify system design (e.g., forward error correction design).

113 citations


Network Information
Related Topics (5)
Network packet
159.7K papers, 2.2M citations
96% related
Wireless ad hoc network
49K papers, 1.1M citations
96% related
Wireless network
122.5K papers, 2.1M citations
95% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023133
2022325
2021694
2020846
20191,033
2018993