Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements

D. K. Lee, K. Jang, Changhyun Lee, G. Iannaccone, S. Moon
{"title":"Path Stitching: Internet-Wide Path and Delay Estimation from Existing Measurements","authors":"D. K. Lee, K. Jang, Changhyun Lee, G. Iannaccone, S. Moon","doi":"10.1109/INFCOM.2010.5462243","DOIUrl":null,"url":null,"abstract":"Many measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to improve end-user experience. A common hurdle they face is the need to deploy yet another measurement infrastructure. In this work, we demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The main contribution of this paper is an estimation algorithm that breaks down measurement data into segments, identifies relevant segments efficiently, and, by carefully stitching segments together, produces delay and path estimates between any two end points. Fittingly, we call our algorithm path stitching. Our results show remarkably good accuracy: error in delay is below 20 ms in 80% of end-to-end paths.","PeriodicalId":259639,"journal":{"name":"2010 Proceedings IEEE INFOCOM","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Proceedings IEEE INFOCOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2010.5462243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Many measurement systems have been proposed in recent years to shed light on the internal performance of the Internet. Their common goal is to allow distributed applications to improve end-user experience. A common hurdle they face is the need to deploy yet another measurement infrastructure. In this work, we demonstrate that without any new measurement infrastructure or active probing we obtain composite performance estimates from AS-by-AS segments and the estimates are as good as (or even better than) those from existing estimation methodologies that use on-demand, customized active probing. The main contribution of this paper is an estimation algorithm that breaks down measurement data into segments, identifies relevant segments efficiently, and, by carefully stitching segments together, produces delay and path estimates between any two end points. Fittingly, we call our algorithm path stitching. Our results show remarkably good accuracy: error in delay is below 20 ms in 80% of end-to-end paths.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
路径拼接:基于现有测量的全互联网路径和延迟估计
近年来提出了许多测量系统来阐明互联网的内部性能。它们的共同目标是允许分布式应用程序改善最终用户体验。他们面临的一个常见障碍是需要部署另一个度量基础设施。在这项工作中,我们证明了在没有任何新的测量基础设施或主动探测的情况下,我们可以从as - as段获得复合性能估计,并且估计与使用按需定制的主动探测的现有估计方法一样好(甚至更好)。本文的主要贡献是一种估计算法,该算法将测量数据分解成片段,有效地识别相关片段,并通过仔细地将片段拼接在一起,产生任意两个端点之间的延迟和路径估计。恰当地说,我们称之为路径拼接算法。我们的结果显示出非常好的准确性:在80%的端到端路径中延迟误差低于20 ms。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Truthful Least-Priced-Path Routing in Opportunistic Spectrum Access Networks Overcoming Failures: Fault-tolerance and Logical Centralization in Clean-Slate Network Management Improving QoS in BitTorrent-like VoD Systems Lightweight Mutual Authentication and Ownership Transfer for RFID Systems Overhearing-aware Joint Routing and Rate Selection in Multi-hop Multi-rate UWB-based WPANs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1