端到端单播测量的网络拓扑推断

A. Malekzadeh, M. MacGregor
{"title":"端到端单播测量的网络拓扑推断","authors":"A. Malekzadeh, M. MacGregor","doi":"10.1109/WAINA.2013.215","DOIUrl":null,"url":null,"abstract":"Network tomography is the problem of discovering the delay and loss rate of the internal links of a network, assuming the internal nodes are not cooperating. The first step to solving this problem is finding network topology. Well-known tools such as trace route solve this problem, however they depend on cooperation of the internal nodes. This paper studies the problem of topology identification without relying on the cooperation of the internal nodes of the network. First, we suggest a novel probing scheme which is based on end-to-end unicast delay measurements. We then introduce a topology inference algorithm which uses the information from this probing scheme to find the topology of the network. Our experiments show that this approach improves the topology identification process compared to previous methods.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Network Topology Inference from End-to-End Unicast Measurements\",\"authors\":\"A. Malekzadeh, M. MacGregor\",\"doi\":\"10.1109/WAINA.2013.215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network tomography is the problem of discovering the delay and loss rate of the internal links of a network, assuming the internal nodes are not cooperating. The first step to solving this problem is finding network topology. Well-known tools such as trace route solve this problem, however they depend on cooperation of the internal nodes. This paper studies the problem of topology identification without relying on the cooperation of the internal nodes of the network. First, we suggest a novel probing scheme which is based on end-to-end unicast delay measurements. We then introduce a topology inference algorithm which uses the information from this probing scheme to find the topology of the network. Our experiments show that this approach improves the topology identification process compared to previous methods.\",\"PeriodicalId\":359251,\"journal\":{\"name\":\"2013 27th International Conference on Advanced Information Networking and Applications Workshops\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 27th International Conference on Advanced Information Networking and Applications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2013.215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2013.215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

网络断层扫描是在假设网络内部节点不合作的情况下,发现网络内部链路的延迟和损失率的问题。解决这个问题的第一步是找到网络拓扑。众所周知,跟踪路由等工具可以解决这个问题,但它们依赖于内部节点的合作。本文研究了不依赖于网络内部节点协作的拓扑识别问题。首先,我们提出了一种新的基于端到端单播延迟测量的探测方案。然后,我们引入了一种拓扑推断算法,该算法使用该探测方案的信息来查找网络的拓扑。我们的实验表明,与以前的方法相比,该方法改善了拓扑识别过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Network Topology Inference from End-to-End Unicast Measurements
Network tomography is the problem of discovering the delay and loss rate of the internal links of a network, assuming the internal nodes are not cooperating. The first step to solving this problem is finding network topology. Well-known tools such as trace route solve this problem, however they depend on cooperation of the internal nodes. This paper studies the problem of topology identification without relying on the cooperation of the internal nodes of the network. First, we suggest a novel probing scheme which is based on end-to-end unicast delay measurements. We then introduce a topology inference algorithm which uses the information from this probing scheme to find the topology of the network. Our experiments show that this approach improves the topology identification process compared to previous methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信