Intersection characteristics of end-to-end Internet paths and trees

Sevcan Bilir, K. Saraç, T. Korkmaz
{"title":"Intersection characteristics of end-to-end Internet paths and trees","authors":"Sevcan Bilir, K. Saraç, T. Korkmaz","doi":"10.1109/ICNP.2005.20","DOIUrl":null,"url":null,"abstract":"This paper focuses on understanding the scale and the distribution of \"state overhead'' (briefly load) that is incurred on the routers by various value-added network services, e.g., IP multicast and IP traceback. This understanding is essential to developing appropriate mechanisms and provisioning resources so that the Internet can support such value-added services in an efficient and scalable manner. We mainly consider the number of end-to-end paths or trees intersecting at a router to represent the amount of state overhead at that router. Hence, we analyze the router-level intersection characteristics of end-to-end Internet paths or trees to approximate the state overhead distribution in the Internet. For the reliability of our analysis, a representative, end-to-end router-level Internet map is essential. Although several maps are available, they are at best insufficient for our analysis. Therefore, in the first part of our work, we exert a measurement study to obtain a large size end-to-end router-level map conforming to our constraints. In the second part, we conduct various experiments using our map and shed some light on the scale and distribution of state overhead of value-added Internet services in both unicast and multicast environments.","PeriodicalId":191961,"journal":{"name":"13TH IEEE International Conference on Network Protocols (ICNP'05)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"13TH IEEE International Conference on Network Protocols (ICNP'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNP.2005.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

Abstract

This paper focuses on understanding the scale and the distribution of "state overhead'' (briefly load) that is incurred on the routers by various value-added network services, e.g., IP multicast and IP traceback. This understanding is essential to developing appropriate mechanisms and provisioning resources so that the Internet can support such value-added services in an efficient and scalable manner. We mainly consider the number of end-to-end paths or trees intersecting at a router to represent the amount of state overhead at that router. Hence, we analyze the router-level intersection characteristics of end-to-end Internet paths or trees to approximate the state overhead distribution in the Internet. For the reliability of our analysis, a representative, end-to-end router-level Internet map is essential. Although several maps are available, they are at best insufficient for our analysis. Therefore, in the first part of our work, we exert a measurement study to obtain a large size end-to-end router-level map conforming to our constraints. In the second part, we conduct various experiments using our map and shed some light on the scale and distribution of state overhead of value-added Internet services in both unicast and multicast environments.
端到端互联网路径和树的交叉特性
本文的重点是了解各种增值网络业务(如IP组播和IP回溯)在路由器上产生的“状态开销”(简称负载)的规模和分布。这种理解对于开发适当的机制和提供资源至关重要,以便Internet能够以有效和可扩展的方式支持此类增值服务。我们主要考虑在路由器上相交的端到端路径或树的数量,以表示该路由器上的状态开销。因此,我们分析了端到端互联网路径或树的路由器级交叉特征,以近似互联网中的状态开销分布。为了我们分析的可靠性,一个有代表性的端到端路由器级互联网地图是必不可少的。虽然有几张地图可供使用,但对我们的分析来说,它们充其量是不够的。因此,在我们的第一部分工作中,我们进行了测量研究,以获得符合我们约束的大尺寸端到端路由器级映射。在第二部分中,我们使用我们的地图进行了各种实验,并阐明了在单播和多播环境中增值互联网服务的状态开销的规模和分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信