{"title":"Coordinate-Based Routing for Overlay Networks","authors":"V. Pappas, V. Hilt, M. Hofmann","doi":"10.1109/ICCCN.2007.4317900","DOIUrl":null,"url":null,"abstract":"Overlay networks are widely used as a way to introduce novel Internet services and to improve the reliability and performance of today's Internet. Traditionally, overlay networks perform routing by mimicking the underlying IP routing protocols, which does not scale well with the system size. In this paper, we propose a fundamentally new approach to overlay routing that is based on network coordinates. Our evaluation shows that this approach is scalable to a large number of overlay nodes with a message complexity of O(N) while providing routing decisions that are close to optimal in terms of error resilience and path delay.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 16th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2007.4317900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Overlay networks are widely used as a way to introduce novel Internet services and to improve the reliability and performance of today's Internet. Traditionally, overlay networks perform routing by mimicking the underlying IP routing protocols, which does not scale well with the system size. In this paper, we propose a fundamentally new approach to overlay routing that is based on network coordinates. Our evaluation shows that this approach is scalable to a large number of overlay nodes with a message complexity of O(N) while providing routing decisions that are close to optimal in terms of error resilience and path delay.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
