Packet loss

About: Packet loss is a research topic. Over the lifetime, 21235 publications have been published within this topic receiving 302453 citations.

End-to-end internet packet dynamics

Abstract: We discuss findings from a large-scale study of Internet packet dynamics conducted by tracing 20000 TCP bulk transfers between 35 Internet sites. Because we traced each 100-kbyte transfer at both the sender and the receiver, the measurements allow us to distinguish between the end-to-end behavior due to the different directions of the Internet paths, which often exhibit asymmetries. We: (1) characterize the prevalence of unusual network events such as out-of-order delivery and packet replication; (2) discuss a robust receiver-based algorithm for estimating "bottleneck bandwidth" that addresses deficiencies discovered in techniques based on "packet pair;" (3) investigate patterns of packet loss, finding that loss events are not well modeled as independent and, furthermore, that the distribution of the duration of loss events exhibits infinite variance; and (4) analyze variations in packet transit delays as indicators of congestion periods, finding that congestion periods also span a wide range of time scales.

Networked Control Systems With Communication Constraints: Tradeoffs Between Transmission Intervals, Delays and Performance

Abstract: There are many communication imperfections in networked control systems (NCS) such as varying transmission delays, varying sampling/transmission intervals, packet loss, communication constraints and quantization effects. Most of the available literature on NCS focuses on only some of these aspects, while ignoring the others. In this paper we present a general framework that incorporates communication constraints, varying transmission intervals and varying delays. Based on a newly developed NCS model including all these network phenomena, we will provide an explicit construction of a continuum of Lyapunov functions. Based on this continuum of Lyapunov functions we will derive bounds on the maximally allowable transmission interval (MATI) and the maximally allowable delay (MAD) that guarantee stability of the NCS in the presence of communication constraints. The developed theory includes recently improved results for delay-free NCS as a special case. After considering stability, we also study semi-global practical stability (under weaker conditions) and performance of the NCS in terms of Lp gains from disturbance inputs to controlled outputs. The developed results lead to tradeoff curves between MATI, MAD and performance gains that depend on the used protocol. These tradeoff curves provide quantitative information that supports the network designer when selecting appropriate networks and protocols guaranteeing stability and a desirable level of performance, while being robust to specified variations in delays and transmission intervals. The complete design procedure will be illustrated using a benchmark example.

A Proposal to add Explicit Congestion Notification (ECN) to IP

Abstract: This note describes a proposed addition of ECN (Explicit Congestion Notification) to IP. TCP is currently the dominant transport protocol used in the Internet. We begin by describing TCP's use of packet drops as an indication of congestion. Next we argue that with the addition of active queue management (e.g., RED) to the Internet infrastructure, where routers detect congestion before the queue overflows, routers are no longer limited to packet drops as an indication of congestion. Routers could instead set a Congestion Experienced (CE) bit in the packet header of packets from ECN-capable transport protocols. We describe when the CE bit would be set in the routers, and describe what modifications would be needed to TCP to make it ECN-capable. Modifications to other transport protocols (e.g., unreliable unicast or multicast, reliable multicast, other reliable unicast transport protocols) could be considered as those protocols are developed and advance through the standards process.

A Protocol for Packet Network Intercommunication

Abstract: A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections. Some implementation issues are considered, and problems such as internetwork routing, accounting, and timeouts are exposed.

End-to-end packet delay and loss behavior in the internet

Abstract: We use the measured round trip delays of small UDP probe packets sent at regular time intervals to analyze the end-to-end packet delay and loss behavior in the Internet. By varying the interval between probe packets, it is possible to study the structure of the Internet load over different time scales. In this paper, the time scales of interest range from a few milliseconds to a few minutes. Our observations agree with results obtained by others using simulation and experimental approaches. For example, our estimates of Internet workload are consistent with the hypothesis of a mix of bulk traffic with larger packet size, and interactive traffic with smaller packet size. We observe compression (or clustering) of the probe packets, rapid fluctuations of queueing delays over small intervals, etc. Our results also show interesting and less expected behavior. For example, we find that the losses of probe packets are essentially random unless the probe traffic uses a large fraction of the available bandwidth. We discuss the implications of these results on the design of control mechanisms for the Internet.