M-coop:用于网络测量的可扩展基础设施

Sridhar Srinivasan, E. Zegura
{"title":"M-coop:用于网络测量的可扩展基础设施","authors":"Sridhar Srinivasan, E. Zegura","doi":"10.1109/WIAPP.2003.1210284","DOIUrl":null,"url":null,"abstract":"We propose M-coop, a scalable, incrementally-deployable, peer-to-peer measurement infrastructure to estimate distance metrics (such as latency, hop count, etc.) between any pair of IP addresses on the Internet. The idea behind M-coop is to have a network of nodes, each of which measures to a small set of peers. When an estimate between two addresses is required, several of these measurements are composed to give the final estimate. Since M-coop is a dynamic peer-to-peer system, we provide and evaluate heuristics for node joins and failures. By conducting experiments on the Internet, we show that our approach has performance similar to other schemes such as IDMaps (P. Francis et al., 2001.","PeriodicalId":179377,"journal":{"name":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"M-coop: a scalable infrastructure for network measurement\",\"authors\":\"Sridhar Srinivasan, E. Zegura\",\"doi\":\"10.1109/WIAPP.2003.1210284\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose M-coop, a scalable, incrementally-deployable, peer-to-peer measurement infrastructure to estimate distance metrics (such as latency, hop count, etc.) between any pair of IP addresses on the Internet. The idea behind M-coop is to have a network of nodes, each of which measures to a small set of peers. When an estimate between two addresses is required, several of these measurements are composed to give the final estimate. Since M-coop is a dynamic peer-to-peer system, we provide and evaluate heuristics for node joins and failures. By conducting experiments on the Internet, we show that our approach has performance similar to other schemes such as IDMaps (P. Francis et al., 2001.\",\"PeriodicalId\":179377,\"journal\":{\"name\":\"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIAPP.2003.1210284\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIAPP.2003.1210284","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

我们提出M-coop,这是一种可扩展的、可增量部署的点对点测量基础设施,用于估计互联网上任何一对IP地址之间的距离度量(如延迟、跳数等)。M-coop背后的想法是拥有一个节点网络,每个节点都测量一小组对等节点。当需要在两个地址之间进行估计时,将这些测量中的几个组成以给出最终估计。由于M-coop是一个动态点对点系统,我们提供并评估了节点连接和故障的启发式方法。通过在互联网上进行实验,我们表明我们的方法具有类似于其他方案(如IDMaps)的性能(P. Francis等人,2001)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
M-coop: a scalable infrastructure for network measurement
We propose M-coop, a scalable, incrementally-deployable, peer-to-peer measurement infrastructure to estimate distance metrics (such as latency, hop count, etc.) between any pair of IP addresses on the Internet. The idea behind M-coop is to have a network of nodes, each of which measures to a small set of peers. When an estimate between two addresses is required, several of these measurements are composed to give the final estimate. Since M-coop is a dynamic peer-to-peer system, we provide and evaluate heuristics for node joins and failures. By conducting experiments on the Internet, we show that our approach has performance similar to other schemes such as IDMaps (P. Francis et al., 2001.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信