基于Region多层结构P2P计算网络模型
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant No.60273075 (国家自然科学基金); the Key Project in Hu'nan Provincial Department of Education of China under Grant No.03A036 (湖南省教育厅重点项目 )


A P2P Network Model with Multi-Layer Architecture Based on Region
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [20]
  • |
  • 相似文献
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    分布式P2P网络Gnutella模型中共享信息查询的路由协议为"洪泛"算法,其协议机制仅在应用层实现,缺乏对Internet底层通信子网路由资源的利用,存在可扩展性、性能与效率不高的问题.以"小世界和幂规律"模型为理论基础,以层和域为基本逻辑管理单位,按用户需求和共享目的组织域,提出了基于Region多层结构P2P网络模型RLP2P(region-layer P2P),实现了其系统原型;实现了一个优化的Multilayer Light-Gossip分级路由策略;量化分析了表征模型数据通道质量指标的压力和伸展率,提出了综合考虑压力和伸展率的思想.模拟分析表明,RLP2P模型可以有效地解决可扩展性、性能与效率不高问题,且网络规模越大,其综合性能的优越性越明显.因此,模型是合理、有效的.

    Abstract:

    Gnutella application layer protocol simply uses flooding algorithm to route peer’s querying, which is just implemented on application layer and doesn’t use down-layer’s information routing of Internet. So it has poor scalability and low efficiency. This paper uses the model of “small world and power law” as the theoretical foundation, and in the light of the users’ requirement and a shared organization layer and region of logic manage-unit, a new distributed peer-to-peer network model of RLP2P(region-layer P2P) with multi-layer structure based on region is proposed, and its prototype system is implemented. A new optimized Multilayer Light-Gossip route strategy is implemented. This paper studies the stress and stretch with the model which has two intuitive metrics of goodness defined to evaluate the quality of the data paths. At the same time, the idea is put forward about the tradeoffs between the stress and stretch. Simulation results about RLP2P’s protocol show that it could effectively solve the above problems, and the larger the network size is, the more obvious the superiority of its comprehensive performance is. So the model is reasonable and effective.

    参考文献
    [1]Parameswaran M, Susarla A, Whinston AB. P2P networking: An information-sharing alternative. Computing Practices, 2001,34(7):31-38.
    [2]Napster. http://www.napster.com
    [3]Gnutella.http://www.gnutella.com
    [4]Jose S. The emergence of distributed content management and peer-to-peer content networks. Gartner GroupInc 2001.http://marketplacena.gartner.com/010022501 oth-NextPage. PDF
    [5]Zeinalipour-Yazti D, Folias T. A quantitative analysis of the gnutella network traffic. April 2002. http//www.cs.ucr.edu/~csyiazti/courses/cs204/project/html/final.html/
    [6]Clarke I, Sandberg O, Wiley B, Hong TW. Freenet: A distributed anonymous information storage and retrieval system. 2004-08-10.http://www.doc.ic.ac.uk/~twh 1/academic/papers/icsi-revised.pdf/
    [7]Traversat B, Arora A, Abdelaziz M, Duigou M, Haywood C, Hugly J-C, Pouyoul E, Yeager B. Project JXTA 2.0 Super-Peer Virtual Network. 2004-09-20. http://www.jxta.org/project/www/docs/JXTA2.0protocolsl.pdf/
    [8]Super-Peer Architectures for Distributed Computing. 2004-09-20. http://www.fiorano.com/whitepapers/superpeer.pdf/
    [9]Kleinberg J. The small-world phenomenon: An algorithmic perspective. ACM Symp. on Theory of Computing, 2000. 820-828.http://nicomedia.math.upatras.gr/courses/mnets/mat/Kleinberg_SW_algorithmic.pdf/
    [10]Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology. In: Chapin L, Sterbenz JPG, Parulkar G, Turner JS, eds. Proc. of the ACM SIGCOMM'99. New York: ACM Press, 1999. 251-262.
    [11]Siganos G, Faloutsos M, Faloutsos P, Faloutsos C. Power-Laws and the AS-level internet topology. 2004-10-05.http://www.cs.ucr.edu/~siganos/papers/SFFF.pdf/
    [12]Yang B, Garcia-Molina H. Improving search in peer-to-peer networks. In: Proc. of the 22nd Int'l Conf. Distributed Computing Systems. IEEE Computer Society, 2002. 5-14.
    [13]Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I. Looking up data in P2P systems. Communications of the ACM,2003,46(2):43-48.
    [14]Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proc. of the ACM SIGCOMM (SIGCOMM'01). 2001.149-160.
    [15]Kempe D, Kleinberg J. Demers A. Spatial gossip and resource location protocols. In: Proc. of the 33rd ACM Symp. on Theory of Computing (STOC'01). 2001. 163-172.
    [16]Plaxton CG, Rajaraman R, Richa AW. Accessing nearby copies of replicated objects in a distributed environment. In: ACM Symp.on Parallel Algorithms and Architectures, 1997.311-320. http://citeseer. ist.psu.edu/plaxton97accessing.html/
    [17]Gupta A. Steiner points in tree metrics don't (really) help. In: Symp. of Discrete Algorithms. 2001. 220-227.
    [18]Chu Y-H, Rao SG, Zhang H. A case for end system multicast. IEEE Journal on Volume 20, 2002. 1456-1471.
    [19]Magoni D. hem: A software for network topology analysis and modeling. In: Proc. of the 10th IEEE Int'l Symp. on Modeling,Analysis, & Simulation of Computer & Telecommunications Systems (MASCOTS'02). 2002. 364-371.
    [20]Palmer CR, Steffan JG. Generating network topologies that obey power laws. In: Proc. of the Global Telecommunications Conf.(GLOBECOM 2000). IEEE, 2000. 434-438.
    相似文献
    引证文献
引用本文

乐光学,李仁发,周祖德.基于Region多层结构P2P计算网络模型.软件学报,2005,16(6):1140-1150

复制
分享
文章指标
  • 点击次数:3999
  • 下载次数: 5714
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2004-12-29
  • 最后修改日期:2005-03-11
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号