有限端到端可达性下的网络覆盖结构

Wenjie Wang, Cheng Jin, S. Jamin
{"title":"有限端到端可达性下的网络覆盖结构","authors":"Wenjie Wang, Cheng Jin, S. Jamin","doi":"10.1109/INFCOM.2005.1498488","DOIUrl":null,"url":null,"abstract":"Network-overlay construction today assumes two-way communication capability - each host can initiate outgoing connections as well as accepting incoming connections. This is often not true on the current Internet due to several reasons, for example, the use of network address translation (NAT) and firewalls. Our experiments with eDonkey and Gnutella file-sharing systems reveal that as many as 36% of the hosts may be guarded - not accepting incoming connections. This presents a challenge to overlay construction because not all hosts are capable of receiving and forwarding requests. We propose an overlay optimization called e* to help existing overlay protocols overcome the reachability problem. Furthermore, e* builds very efficient overlay networks in terms of latency. Under realistic scenarios involving guarded hosts, e* can reduce the average overlay latency by 28-61% compared with existing protocols.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"11 1","pages":"2124-2134 vol. 3"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Network overlay construction under limited end-to-end reachability\",\"authors\":\"Wenjie Wang, Cheng Jin, S. Jamin\",\"doi\":\"10.1109/INFCOM.2005.1498488\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network-overlay construction today assumes two-way communication capability - each host can initiate outgoing connections as well as accepting incoming connections. This is often not true on the current Internet due to several reasons, for example, the use of network address translation (NAT) and firewalls. Our experiments with eDonkey and Gnutella file-sharing systems reveal that as many as 36% of the hosts may be guarded - not accepting incoming connections. This presents a challenge to overlay construction because not all hosts are capable of receiving and forwarding requests. We propose an overlay optimization called e* to help existing overlay protocols overcome the reachability problem. Furthermore, e* builds very efficient overlay networks in terms of latency. Under realistic scenarios involving guarded hosts, e* can reduce the average overlay latency by 28-61% compared with existing protocols.\",\"PeriodicalId\":20482,\"journal\":{\"name\":\"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.\",\"volume\":\"11 1\",\"pages\":\"2124-2134 vol. 3\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.2005.1498488\",\"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 IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2005.1498488","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

今天的网络覆盖结构假定具有双向通信能力——每个主机可以发起传出连接,也可以接受传入连接。由于一些原因,例如网络地址转换(NAT)和防火墙的使用,在当前的Internet上通常不是这样的。我们对eDonkey和Gnutella文件共享系统的实验表明,多达36%的主机可能受到保护-不接受传入的连接。这对覆盖结构提出了挑战,因为并非所有主机都能够接收和转发请求。我们提出了一种称为e*的覆盖优化来帮助现有的覆盖协议克服可达性问题。此外,e*在延迟方面构建了非常有效的覆盖网络。在涉及受保护主机的现实场景下,与现有协议相比,e*可以将平均覆盖延迟降低28-61%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Network overlay construction under limited end-to-end reachability
Network-overlay construction today assumes two-way communication capability - each host can initiate outgoing connections as well as accepting incoming connections. This is often not true on the current Internet due to several reasons, for example, the use of network address translation (NAT) and firewalls. Our experiments with eDonkey and Gnutella file-sharing systems reveal that as many as 36% of the hosts may be guarded - not accepting incoming connections. This presents a challenge to overlay construction because not all hosts are capable of receiving and forwarding requests. We propose an overlay optimization called e* to help existing overlay protocols overcome the reachability problem. Furthermore, e* builds very efficient overlay networks in terms of latency. Under realistic scenarios involving guarded hosts, e* can reduce the average overlay latency by 28-61% compared with existing protocols.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信