Challenges in Inferring Internet Interdomain Congestion

Challenges in Inferring Internet Interdomain Congestion
复制标题

推断互联网域间拥塞的挑战

DOI:
10.1145/2663716.2663741
复制
发表时间:
2014
期刊:
Proceedings of the 2014 Conference on Internet Measurement Conference
影响因子:
--
通讯作者:
K. Claffy
K. Claffy
中科院分区:
--
文献类型:
--
作者:
M. Luckie;A. Dhamdhere;D. Clark;B. Huffaker;K. Claffy

文献摘要

被引文献

相似文献

我们介绍和演示的实用程序的方法来本地化和量化域间的拥塞在互联网上。我们的时间序列延迟探测(TSLP)方法取决于两个事实:互联网流量模式通常是昼夜的,队列增加数据包延迟通过路由器在相邻链路拥塞期间。从单个测试点到拥塞链路的两个边缘的重复往返延迟测量将显示持续增加的延迟到链路的远侧(但不是到近侧),延迟模式不同于非拥塞链路的典型昼夜模式。我们描述了我们的技术及其惊人的潜力,仔细分析了最大的挑战与方法(域间路由器级拓扑推断),描述其他不太严重的挑战,并提出了初步的结果,有足够的希望激励进一步关注克服的挑战。
We introduce and demonstrate the utility of a method to localize and quantify inter-domain congestion in the Internet. Our Time Sequence Latency Probes (TSLP) method depends on two facts: Internet traffic patterns are typically diurnal, and queues increase packet delay through a router during periods of adjacent link congestion. Repeated round trip delay measurements from a single test point to the two edges of a congested link will show sustained increased latency to the far (but not to the near) side of the link, a delay pattern that differs from the typical diurnal pattern of an uncongested link. We describe our technique and its surprising potential,carefully analyze the biggest challenge with the methodology (interdomain router-level topology inference), describe other less severe challenges, and present initial results that are sufficiently promising to motivate further attention to overcoming the challenges.