Characterizing End-to-End Packet Delay and Loss in the Internet
Journal of High Speed NetworksPublished 1 January 1993
Jean-Chrysostome Bolot
Citations377
SJR quartileQ3
SJR score0.24
SNIP0.34
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
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 and a phenomenon of compression of the probe packets similar to the acknowledgement compression phenomenon recently observed in TCP.
Abstract
We use the measured round trip delays of small UDP probe packets sent at regular time intervals to characterize 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
Keywords
Computer ScienceEngineering
ACM SIGCOMM Computer Communication ReviewCongestion avoidance and control
5,337 Citations1995Van Jacobson
The measurements and the reports of beta testers suggest that the final product is fairly good at dealing with congested conditions on the Internet, and an algorithm recently developed by Phil Karn of Bell Communications Research is described in a soon-to-be-published RFC.
Supporting real-time applications in an Integrated Services Packet Network
850 Citations1992David D. Clark, Scott Shenker +1 more
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN), and proposes an ISPN architecture that supports two distinct kinds of real time service: guaranteed service, which involves pre-computed worst-case delay bounds, and predicted service which uses the measure performance of the network in computing delay bounds.
Journal of the Royal Statistical Society Series C (Applied Statistics)Queueing Systems, Volume 2: Computer Applications.
550 Citations1978G. J. A. Stern, Leonard Kleinrock
This book presents and develops methods from queuing theory in sufficient depth so that students and professionals may apply these methods to many modern engineering problems, as well as conduct creative research in the field.
ACM SIGCOMM Computer Communication ReviewThe design philosophy of the DARPA Internet Protocols
405 Citations1995David D. Clark
Observations on the dynamics of a congestion control algorithm
377 Citations1991Lixia Zhang, Scott Shenker +1 more
This paper uses simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3-Tahoe TCP implementation and finds that the one-way traffic clustering and loss-synchronization phenomena persist in this new situation, albeit in a slightly modified form.
Packet recovery in high-speed networks using coding and buffer management
233 Citations2002N. Shacham, Paul E. McKenney
A technique for fiber-optic networks based on forward-error correction (FEC) that allows the destination to reconstruct missing data packets by using redundant parity packets that the source adds to each block of data packets is presented.
Characteristics of wide-area TCP/IP conversations
224 Citations1991Ramón Cáceres, Peter B. Danzig +2 more
The model characterizes individual TCP conversations by the distributions of number of bytes transferred, duration, number of packets transferred, packet size, and packet interarrival time and shows that interactive applications send significantly different amounts of data in each direction of a conversation.
ScholarlyCommons (University of Pennsylvania)On the Dynamics and Significance of Low Frequency Components of Internet Load
223 Citations1992Amarnath Mukherjee
This study attempts to characterize the dynamics of Internet workload from an end-point perspective and concludes that efficient congestion control is still a very difficult problem in large internetworks.
Observing TCP dynamics in real networks
223 Citations1992Jeffrey C. Mogul
By analyzing traces of a busy segment of the Internet, it is shown how it is possible to observe pheonomena of the TCP protocol in “real life” and measure both their frequency and their effects on performance.
ACM Transactions on Computer SystemsImproving round-trip time estimates in reliable transport protocols
180 Citations1991P. Karn, Craig Partridge
This paper reviews the various approaches to retransmission and presents a novel and effective approach to the retransmissions ambiguity problem.
IEEE Transactions on Information TheoryAnalysis of packet loss processes in high-speed networks
175 Citations1993Israel Cidon, A. Khamisy +1 more
A hop by hop rate-based congestion control scheme
147 Citations1992Partho P. Mishra, Hemant Kanakia
The results indicate that the proposed hop-by-hop rate-based mechanism for congestion control displays stable behavior for a wide range of traffic conditions and diverse network topologies, and is better than that of the end-to-end control schemes studied here.
Traffic characteristics of the T1 NSFNET backbone
128 Citations2002kc claffy, George C. Polyzos +1 more
The results of a measurement study of the T1 NSFNET backbone are presented and the measurement environment and the approach to data collection are discussed.
Experimental assessment of end-to-end behavior on Internet
114 Citations2002Dheeraj Sanghi, Ashok K. Agrawala +2 more
The measurements indicate that the IP level service provided in the network yields high losses, duplicates, and reorderings of packets, and the round-trip transit delay varies significantly.
IEEE Journal on Selected Areas in CommunicationsAnalysis of a discrete-time single-server queue with bursty inputs for traffic control in ATM networks
78 Citations1990Masayuki Murata, Yuji Oie +2 more
H.261 software Codec for videoconferencing over the internet
62 Citations1993Thierry Turletti
This report describes a low-bandwidth videoconferencing applications on the Internet using the IP multicast extensions and the User Datagram Protocol (UDP) transport protocol and finds that the mean output rate of the coder is less than 30kb/s, thus making videoconference applications possible over low-speed networks such as the Internet.
Traffic characterization of the NSFNET national backbone
50 Citations1990Steven A. Heimlich
This study examines the existence of packet trains on NSFNET, a high speed national backbone network and finds certain protocols exhibit quite strong train behavior given the great number of hosts communicating through the backbone.
Performance comparison of routing protocols using MaRS
37 Citations1992A. Udaya Shankar, Cengiz Alaettinoğlu +2 more
It is shown, using a recently developed network simulator, MaRS, that a newly proposed distance-vector algorithm (ExBF) performs as well as SPF, suggesting that distance- vector algorithms are appropriate for very large wide-area networks.
FYI on a Network Management Tool Catalog: Tools for Monitoring and Debugging TCP/IP Internets and Interconnected Devices
17 Citations1990R.H. Stine
This catalog contains descriptions of several tools available to assist network managers in debugging and maintaining TCP/IP internets and interconnected communications resources.
Computer Networks and ISDN SystemsStudy of network dynamics
14 Citations1993Dheeraj Sanghi, Ólafur Guðmundsson +1 more
Using a tool, NetDyn, to study the performance of the network from the perspective of users, this work has been able to detect a number of performance problems, including large variation in round-trip times and high loss rates.
Queueing SystemsMonitoring the packet gap of real-time packet traffic
13 Citations1992Josep M. Ferrandiz, Aurel A. Lazar
A closed form is derived for the average packet gap for the multiclassG/G/m/B queueing system in equilibrium and it only depends on the loss behavior of two consecutive packets, which considerably simplifies the monitoring process of real-time packet traffic sessions.