微信服务号

微信订阅号

2025年4月25日 0:30 星期五
首页 > 过刊浏览>2005年第16卷第5期 >916-930
PDF HTML阅读 XML下载 导出引用 引用提醒
基于P2P计算模式的自组织网络路由模型
作者:
基金项目:

Supported by the National High-Tech Research and Development Plan of China under Grant No.2001AA111141(国家高技术研究发展计划(863))


A Fine-Grained Coalition Access Control Policy for Jointly-Owned Resources in Collaborative Environments
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [30]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    通过使用peer-to-peer(P2P)计算模式在Internet物理拓扑基础上建立一个称为P2P覆盖网络(P2Poverlay network)的虚拟拓扑结构,有效地建立起一个基于Internet的完全分布式自组织网络路由模型--分级集中式自组织网络路由模型(hierarchical aggregation self-organizing network,简称HASN).分别描述了HASN路由模型的构建目标和体系结构,并详细分析了HASN采用的基于P2P计算模式的分布式命名、路由发现和更新算法HASN Scale,并在仿真实验的基础上,对HASN路由模型的性能进行了验证.

    Abstract:

    Building a virtual network topology named P2P overlay network on top of Internet’s physical topology layer based on P2P computing mode can lead to the effective building of a full-decentralized internet based self-organizing network routing model—hierarchical aggregation self-organizing network (HASN). The target and architecture of HASN are described in this paper, as well as a detailed description of the P2P decentralized naming, route discovering and updating algorithm-HASN_Scale. Simulation results testify the performance of HASN.

    参考文献
    [1]Yemini Y, Trito S. Nestor: Technologies and protocols for self-managed and self-organizing networks. 1998. http://www.cscolumbia.edu/dcc/nestor
    [2]Pottie GJ, Clare LP. Wireless integrated network sensors: Towards low cost and robust self-organizing security networks. In: Proc.of the SPIE Int'l Symp. on Enabling Technologies for Law Enforcement and Security. 1998. 106-112.
    [3]Li ZP, Huang JH, Huang DY, Zhuang L. Introduction to Peer-to-Peer networking technology and development.Telecommunications Science, 2003,19(3):1-4 (in Chinese with English abstract).
    [4]Fox G. Peer-to-Peer networks. Web Computing, 2001,3(3):75-77.
    [5]Saroiu S, Gummadi KP, Dunn R J, Gribble SD, Levy HM. An analysis of Internet content delivery systems. In: Proc. of the 5th Symp. on Operating Systems Design and Implementation (OSDI 2002). 2002. 86-90.
    [6]C-NET NEWS. Napster among fastest-growing Net technologies. 2000. http://news.com.com/2100-1023-246648.html
    [7]Clarke I, Sandberg O, Wiley B, Hong TW. Freenet: A distributed anonymous information storage and retrieval system. In:Workshop on Design Issues in Anonymity and Unobservability. 2000. 25-31.
    [8]Gnutella. 2003. http://www.gnutella.com/
    [9]Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Annual Conf. of the Special Interest Group on Data Communication (SIGCOMM 2001). 2001. 168-175.
    [10]Stoica I, Morris R, Karger D, Kaashoek MF, Balakrishnan H. Chord: A scalable peer-to-peer lookup service for Internet applications. In: Annual Conf. of the Special Interest Group on Data Communication (SIGCOMM 2001). 2001. 124-137.
    [11]Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Int'l Conf. on Distributed Systems Platforms (Middleware 2001). 2001. 135-141.
    [12]Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, U. C. Berkeley, 2001. 106-115.
    [13]Jain S, Mahajan R, Wetherall D. A study of the performance potential of DHT-based overlays. In: Proc. of the 4th USENIX Symp.on Internet Technologies and Systems (USITS 2003). 2003.256-261.
    [14]Dabek F, Kaashoek MF, Karger D, Morris R, Stoica I. Wide-Area cooperative storage with CFS. In: Proc. of the 18th ACM Symp.on Operating Systems Principles (SOSP 2001). Chateau Lake Louise, 2001. 344-352.
    [15]Li ZP, Zhao XB, Huang JH. Construction of user registration and user evaluating system in peer-to-peer network.Telecommunications Science, 2004, 20(5): 14-18 (in Chinese with English abstract).
    [16]Glewin D. Consistent hashing and random trees: Algorithms for caching in distributed networks [MS. Thesis]. Department of EECS,MIT, 1998. http://thesis.mit.edu/
    [17]Karger D, Lehman E, Leighton F, Levine M, Lewin D, Panigrahy R. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. of the 29th Annual ACM Symp. on Theory of Computing. El Paso, 1997. 654-663.
    [18]Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Workshop on Hot Topics in Operating Systems (HOTOS IX). 2003.452-458.
    [19]Ratnasamy S, Shenker S, Stoica I. Routing algorithms for dhts: Some open questions. In: Proc. of the IPTPS02. Cambridge, 2002.http://www. cs.rice.edu/Conferences/IPTPS02/
    [20]Zegura E, Calvert KL, Bhattacharjee S. How to model an internetwork. In: Sohraby K, ed. Proc. of the IEEE Infocom'96. San Francisco: IEEE Computer Society Press, 1996. 594-602.
    [21]Lv Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks. In: Proc. of the 16th ACM Int'l Conf. on Supercomputing (ICS 2002). 2002. 254-261.
    [22]Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the XOR metric. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002). 2002. 153-161.
    [23]Weatherspoon H, Kubiatowicz J. Efficient heartbeats and repair of softstate in decentralized object location and routing systems. In:Proc. of the ACM SIGOPS European Workshop 2002. 2002.231-238.
    [24]Mahajan R, Castro M, Rowston A. Controlling the cost of reliability in peer-to-peer overlays. In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems (IPTPS 2003). 2003. 368-374.
    [25]Xu Z, Zhang Z. Building low-maintenance expressways for P2P systems. Technical Report HPL-2002-41, Palo Alto:Hewlett-Packard Lab., 2002.
    [26]Zhao BY, Duan Y, Huang L, Joseph A, Kubiatowicz J. Brocade: Landmark routing on overlay networks. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems (IPTPS 2002). 2002. 564-570.
    [27]Perkins C, Belding-Royer EM, Das SR. Ad hoc on-demand distance vector (AODV) routing. Network Working Group RFC 3561,2003.
    [28](E)apkun S, Buttyan L, Hubaux JP. Self-Organized public-key management for ad hoc networks. IEEE Trans. on Mobile Computing,2003,2( 1 ):203-213.
    [29]李祖鹏,黄建华,黄道颖,庄雷.P2P网络技术的发展与展望.电信科学,2003,19(3):1-4.
    [30]李祖鹏,赵修斌,黄建华.P2P网络用户注册和评估系统的建立.电信科学,2004,20(5):14-18.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

李祖鹏,黄建华,唐辉.基于P2P计算模式的自组织网络路由模型.软件学报,2005,16(5):916-930

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

京公网安备 11040202500063号