Peer the peers: an overlay id assignment service at internet exchange points

Matthias Wählisch, T. Schmidt
{"title":"Peer the peers: an overlay id assignment service at internet exchange points","authors":"Matthias Wählisch, T. Schmidt","doi":"10.1145/1658997.1659022","DOIUrl":null,"url":null,"abstract":"P2P networks enable end users to establish services relying neither on a dedicated infrastructure nor on an ISP deployment of enhanced services at the network layer. Regrettably, overlay traffic is not optimal with respect to native connections and peering agreements, but may decrease network quality at end users at increased transit costs. This issue has been addressed by traffic localization approaches: The general objective is to keep overlay traffic local and to minimize provider crossing. Current efforts foster provider-assisted solutions. Overlays, which approximate network paths from the underlay, promise to significantly limit inter-domain traffic. However, ISPs offering transits rejoice in additional traffic and may provide localization data to delocalize peers. In this paper, we argue that ISP interaction should be provided by neutral authorities, namely the Internet exchange points. We present an architecture which serves unstructured and structured overlay peers with a generic overlay ID that jointly reflects AS-paths and peering topologies, and is unbiased by unilateral ISP interests.","PeriodicalId":181045,"journal":{"name":"Co-Next Student Workshop '09","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Co-Next Student Workshop '09","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1658997.1659022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

P2P networks enable end users to establish services relying neither on a dedicated infrastructure nor on an ISP deployment of enhanced services at the network layer. Regrettably, overlay traffic is not optimal with respect to native connections and peering agreements, but may decrease network quality at end users at increased transit costs. This issue has been addressed by traffic localization approaches: The general objective is to keep overlay traffic local and to minimize provider crossing. Current efforts foster provider-assisted solutions. Overlays, which approximate network paths from the underlay, promise to significantly limit inter-domain traffic. However, ISPs offering transits rejoice in additional traffic and may provide localization data to delocalize peers. In this paper, we argue that ISP interaction should be provided by neutral authorities, namely the Internet exchange points. We present an architecture which serves unstructured and structured overlay peers with a generic overlay ID that jointly reflects AS-paths and peering topologies, and is unbiased by unilateral ISP interests.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
对等:在互联网交换点的覆盖id分配服务
P2P网络使最终用户能够建立服务,既不依赖于专用的基础设施,也不依赖于在网络层部署增强服务的ISP。遗憾的是,相对于本地连接和对等协议,覆盖流量不是最优的,但可能会降低最终用户的网络质量,增加传输成本。这个问题已经通过流量定位方法得到了解决:总体目标是保持覆盖流量本地化并最小化提供商交叉。目前的努力促进了供应商协助的解决方案。覆盖层,从底层近似网络路径,承诺显著限制域间流量。然而,提供传输服务的isp会享受额外的流量,并可能向非本地化的对等端提供本地化数据。在本文中,我们认为ISP交互应该由中立的机构,即互联网交换点提供。我们提出了一种体系结构,该体系结构为非结构化和结构化的覆盖节点提供服务,具有通用的覆盖ID,可以共同反映as路径和对等拓扑,并且不受单边ISP利益的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Self-propagating worms in wireless sensor networks A robust pair-wise rekeying protocol in hierarchical wireless sensor networks Practical DHT-based location service for wireless mesh networks Improving roamer retention by exposing weak locations in GSM networks Netflow based system for NAT detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1