Streamlining traceroute by estimating path lengths

T. Moors
{"title":"Streamlining traceroute by estimating path lengths","authors":"T. Moors","doi":"10.1109/IPOM.2004.1547603","DOIUrl":null,"url":null,"abstract":"Traditional traceroute determines the path through a network by sending probe packets with progressively increasing TTL/hop count values so that routers that are progressively further from the inquirer send ICMP time exceeded messages and so reveal their identity. This process can be slow (because traceroute must wait for a timeout or response to one probe before sending the next) and inefficient (through repeated probing of routers near the inquirer that lie on the intersection of paths leading to multiple targets). This paper shows how this process can be streamlined by the inquirer sending a scout packet to the (reachable) target before sending route tracing probes. The inquirer uses the TTL of the response to this scout packet to estimate the length of the path to the target (with tolerance for path asymmetry), and can then either expedite the route tracing process (by sending probes to each of the estimated number of routers on the path in quick succession) or reduce the number of probes needed (by inverting the direction of traditional traceroute, tracing the path from the target towards the inquirer, and terminating the process when it reaches a router on a known path from the inquirer).","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Workshop on IP Operations and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPOM.2004.1547603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Traditional traceroute determines the path through a network by sending probe packets with progressively increasing TTL/hop count values so that routers that are progressively further from the inquirer send ICMP time exceeded messages and so reveal their identity. This process can be slow (because traceroute must wait for a timeout or response to one probe before sending the next) and inefficient (through repeated probing of routers near the inquirer that lie on the intersection of paths leading to multiple targets). This paper shows how this process can be streamlined by the inquirer sending a scout packet to the (reachable) target before sending route tracing probes. The inquirer uses the TTL of the response to this scout packet to estimate the length of the path to the target (with tolerance for path asymmetry), and can then either expedite the route tracing process (by sending probes to each of the estimated number of routers on the path in quick succession) or reduce the number of probes needed (by inverting the direction of traditional traceroute, tracing the path from the target towards the inquirer, and terminating the process when it reaches a router on a known path from the inquirer).
通过估计路径长度简化跟踪路线
传统的traceroute通过发送逐渐增加TTL/hop计数值的探测数据包来确定通过网络的路径,以便逐渐远离查询器的路由器发送ICMP超时消息,从而暴露其身份。这个过程可能很慢(因为traceroute在发送下一个探测之前必须等待一个超时或对一个探测的响应)并且效率低下(通过重复探测位于通往多个目标的路径交叉处的查询器附近的路由器)。本文展示了如何在发送路由跟踪探针之前,通过查询器向(可达)目标发送侦察数据包来简化这一过程。查询器使用对该侦察包的响应的TTL来估计到目标的路径长度(允许路径不对称),然后可以加快路由跟踪过程(通过向路径上的每个估计数量的路由器快速连续发送探针)或减少所需探针的数量(通过反转传统跟踪路由的方向,跟踪从目标到查询器的路径)。当它到达从查询器到达的已知路径上的路由器时终止该进程)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信