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
Journal ArticleDOI
TL;DR: A unified geometric interpretation for wireless quality-aware routing metrics is provided and empirical observations of a real-world wireless mesh network suggest that mETX and ENT could achieve a 50% reduction in the average packet loss rate compared with ETX.
Abstract: This paper considers the problem of selecting good paths in a wireless mesh network. It is well-known that picking the path with the smallest number of hops between two nodes often leads to poor performance, because such paths tend to use links that could have marginal quality. As a result, quality-aware routing metrics are desired for networks that are built solely from wireless radios. Previous work has developed metrics (such as ETX) that work well when wireless channel conditions are relatively static (DeCouto , 2003), but typical wireless channels experience variations at many time-scales. For example, channels may have low average packet loss ratios, but with high variability, implying that metrics that use the mean loss ratio will perform poorly. In this paper, we describe two new metrics, called modified expected number of transmissions (mETX) and effective number of transmissions (ENT) that work well under a wide variety of channel conditions. In addition to analyzing and evaluating the performance of these metrics, we provide a unified geometric interpretation for wireless quality-aware routing metrics. Empirical observations of a real-world wireless mesh network suggest that mETX and ENT could achieve a 50% reduction in the average packet loss rate compared with ETX

236 citations

Journal ArticleDOI
TL;DR: In this article, the authors proposed a control law for high-speed data networks that guarantees stability of network queues and full utilization of network links in a general network topology and traffic scenario during both transient and steady state condition.

235 citations

Patent
22 Jul 2005
TL;DR: In this paper, the authors proposed a remote access architecture for peer-to-peer communications and remote access connectivity, which provides a method for establishing a direct connection between peer computing devices via a third computing device such as a gateway.
Abstract: The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. Additionally, the present invention provides the following techniques to optimize peer-to-peer communications: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access.

234 citations

Proceedings ArticleDOI
02 Nov 2005
TL;DR: Results from analysis, simulation and an experimental 48 Mica2 mote testbed show that virtual sinks can scale mote networks by effectively managing growing traffic demands while minimizing the impact on application fidelity.
Abstract: There is a critical need for new thinking regarding overload traffic management in sensor networks. It has now become clear that experimental sensor networks (e.g., mote networks) and their applications commonly experience periods of persistent congestion and high packet loss, and in some cases even congestion collapse. This significantly impacts application fidelity measured at the physical sinks, even under light to moderate traffic loads, and is a direct product of the funneling effect; that is, the many-to-one multi-hop traffic pattern that characterizes sensor network communications. Existing congestion control schemes are effective at mitigating congestion through rate control and packet drop mechanisms, but do so at the cost of significantly reducing application fidelity measured at the sinks. To address this problem we propose to exploit the availability of a small number of all wireless, multi-radio virtual sinks that can be randomly distributed or selectively placed across the sensor field. Virtual sinks are capable of siphoning off data events from regions of the sensor field that are beginning to show signs of high traffic load. In this paper, we present the design, implementation, and evaluation of Siphon, a set of fully distributed algorithms that support virtual sink discovery and selection, congestion detection, and traffic redirection in sensor networks. Siphon is based on a Stargate implementation of virtual sinks that uses a separate longer-range radio network (based on IEEE 802.11) to siphon events to one or more physical sinks, and a short-range mote radio to interact with the sensor field at siphon points. Results from analysis, simulation and an experimental 48 Mica2 mote testbed show that virtual sinks can scale mote networks by effectively managing growing traffic demands while minimizing the impact on application fidelity.

234 citations

Journal ArticleDOI
TL;DR: The author's recent proposals, namely, timeout-based congestion control, a DECbit scheme and a delay-based scheme for congestion avoidance are described, and areas for future research are suggested.
Abstract: Myths about congestion control are examined, and an explanation of why the trend toward cheaper memory, higher-speed links, and higher-speed processors has intensified the need to solve the congestion problem is provided. A number of proposed solutions are described, and a classification of congestion problems as well as their solutions is presented. The reasons why the problem is so difficult are identified, and the protocol design decisions that affect the design of a congestion control scheme are discussed. The author's recent proposals, namely, timeout-based congestion control, a DECbit scheme and a delay-based scheme for congestion avoidance are described, and areas for future research are suggested. >

233 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