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

End-to-end packet delay and loss behavior in the internet
复制标题

DOI:
10.1145/166237.166265
复制
发表时间:
1993-10
期刊:
--
影响因子:
--
通讯作者:
J. Bolot
J. Bolot
中科院分区:
其他
文献类型:
--
作者:
J. Bolot

文献摘要

被引文献

相似文献

我们使用按常规时间间隔发送的小型UDP探测数据包的测量往返延误来分析互联网中的端到端数据包延迟和损失行为。通过改变探针数据包之间的间隔,可以在不同的时间尺度上研究Internet负载的结构。在本文中,感兴趣的时间范围从几毫秒到几分钟。我们的观察结果与其他人使用模拟和实验方法获得的结果一致。例如,我们对Internet工作负载的估计与较大数据包大小的大容量流量和具有较小数据包大小的交互式流量的假设是一致的。我们观察到探针数据包的压缩(或聚类),在较小间隔上排队延迟的快速波动等。我们的结果还显示出有趣且预期的行为较少。例如,我们发现探针数据包的损失本质上是随机的,除非探针流量使用了可用带宽的很大一部分。我们讨论了这些结果对互联网控制机制设计的含义。
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.