微信服务号

微信订阅号

2025年4月1日 5:17 星期二
首页 > 过刊浏览>2007年第18卷第2期 >381-390
PDF HTML阅读 XML下载 导出引用 引用提醒
一种令P2P覆盖网络拓扑相关的通用方法
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant No.60573131 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant No.2006CB303004 (国家重点基础研究发展规划(973)); the Teaching and Research Award Program for Out


A Generic Approach to Making P2P Overlay Network Topology-Aware
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [18]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    利用分布式哈希表,有结构的对等(peer-to-peer,简称P2P)网络具备了较短的路由长度和较好的扩展性.然而,由此产生了覆盖网络和物理网络之间的不匹配问题,它严重阻碍了在大规模环境下建立有效的对等网络.提出一种通用的、协议无关的方法来解决该问题.该方法基于节点交换机制,通过发现并实施有利于覆盖网络和物理网络匹配的节点交换来降低网络时延、提高性能.实验表明,该方法在明显降低了覆盖网络的平均时延的同时,也保证了额外开销可控.此外,若与其他协议相关的方法相结合,系统性能还可以得到进一步提高.

    Abstract:

    With the help of distributed Hash table, the structured P2P (peer-to-peer) network has a short routing path and good extensibility. However, the mismatch between the overlay and physical network becomes the obstacle in the way of building an effective peer-to-peer system in a large-scale environment. In this paper, a generic, protocol-independent approach is proposed to solve this problem. This method is based on the swaps of peers. By discovering and performing the potential swaps that are beneficial to the match between overlay and physical network, it can reduce the average latency and improve the performance of the system. The experimental results show that the approach can greatly reduce the average latency of overlay networks. Moreover, the cost of overhead is controllable. Besides, if combining this approach with other protocol-dependent ones, the performance can be further improved.

    参考文献
    [1]Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content-addressable network.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.161-172.
    [2]Stoica I,Morris R,Karger D,Kaashoek MF,Balakrishnan H.Chord:A scalable peer-to-peer lookup protocol for Internet applications.In:Govindan R,ed.Proc.of the ACM SIGCOMM.New York:ACM Press,2001.149-160.
    [3]Rowstron A,Druschel P.Pastry:Scalable,decentralized object location and routing for large-scale peer-to-peer systems.In:Guerraoui R,ed.Proc.of the 18th IFIP/ACM Int'l Conf.on Distributed Systems Platforms (Middleware 2001).Heidelberg:Springer-Verlag,2001.329-350.
    [4]Zhao BY,Huang L,Stribling J,Rhea SC,Joseph AD,Kubiatowicz J.Tapestry:A resilient global-scale overlay for service deployment.IEEE Journal on Selected Areas in Communications,2004,22(1):41-53.
    [5]Malkhi D,Maor M,Ratajczak D.Viceroy:A scalable and dynamic emulation of butterfly.In:Ricciardi A,ed.Proc.of the 21st Annual Symp.on Principles of Distributed Computing.New York:ACM Press,2002.182-192.
    [6]Shen HY,Xu CZ,Ghen G.Cycloid:A constant-degree and lookup-efficient P2P overlay network.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 18th Int'l Parallel and Distributed Processing Symp.(IPDPS 2004).New York:IEEE Press,2004.26-30.
    [7]Xu Z,Tang C,Zhang Z.Building topology-aware overlays using global soft-state.In:Panda DK,Duato J,Stunkel C,eds.Proc.of the 23rd Int'l Conf.on Distributed Computing Systems (ICDCS 2003).New York:IEEE Press,2003.500-508.
    [8]Ratnasamy S,Handley M,Karp R,Shenker S.Topologically-Aware overlay construction and server selection.In:Proc.of the IEEE INFOCOM.New York:IEEE Press,2002.1190-1199.
    [9]Winter R,Zahn T,Schiller J.Random land-marking in mobile,topology-aware peer-to-peer networks.In:Proc.of the 10th IEEE Int'l Workshop on Future Trends of Distributed Computing Systems (FTDCS 2004).New York:IEEE Press,2004.319-324.
    [10]Ratnasamy S,Shenker S,Stoica I.Routing algorithms for DHTs:some open questions.In:Druschel P,ed.Proc.of the 1st Int'l Workshop on P2P Systems (IPTPS 2002).Berlin:Springer-Verlag,2002.45-52.
    [11]Castro M,Hu Y,Rowstron A.Exploiting network proximity in distributed hash tables.In:Proc.of the Int'l Workshop on Future Directions in Distributed Computing (FuDiCo 2002).Berlin:Springer-Verlag,2002.52-55.
    [12]Waldvogel M,Rinaldi R.Efficient topology-aware overlay network.ACM Communications Review,2003,33(1):101-106.
    [13]Baumann J,Hohl F,Rothermel K,StraBer M.Mole-Concepts of a mobile agent systems.World Wide Web,1998,1(3):123-137.
    [14]Zegura EW,Calvert KL,Bhattacharjee S.How to model an Internetwork.In:Proc.of the IEEE INFOCOM'96.New York:IEEE Press,1996.594-602.
    [15]Dabek F,Li J,Sit E,Robertson J,Kaashoek MF,Morris R.Designing a DHT for low latency and high throughput.In:Proc.of the 1st USENIX Symp.on Networked Systems Design and Implementation (NSDI 2004).San Francisco:USENI Press,2004.85-98.
    [16]Ge Z,Figueiredo R,Jaisal S,Kurose J,Towsley D.Modeling peer-to-peer files sharing systems.In:Proc.of the IEEE INFOCOM 2003.New York:IEEE Press,2003.2188-2198.
    [17]Ren S,Guo L,Jiang S,Zhang X.SAT-Match:A self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks.In:Proc.of the 18th Int'l Parallel and Distributed Processing Symp.(IPDPS 2004).New York:IEEE Press,2004.83-91.
    [18]Liu Y,Liu X,Xiao L,Li L,Zhang X.Location awareness in unstructured P2P systems.IEEE Trans.on Parallel and Distributed Systems,2005,16(2):163-174. [1]为了方便说明,这里假设连接是无方向的. [1]因为节点规模是n=600,Chord的网络直径大约是d=log2n≈8.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

邱彤庆,陈贵海.一种令P2P覆盖网络拓扑相关的通用方法.软件学报,2007,18(2):381-390

复制
分享
文章指标
  • 点击次数:5308
  • 下载次数: 8060
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2005-10-22
  • 最后修改日期:2006-02-23
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号