• Article
  • | |
  • Metrics
  • |
  • Reference [10]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    This paper presents a novel peer-to-peer structure overlay network SmartBoa. Compared to previous protocols, SmartBoa nodes have routing tables with different sizes, which are determined by the local nodes individually. It is ensured that the bandwidth cost of a node is proportional to its routing table size. Therefore, from the view of the whole system, all the allowable bandwidth are fully utilized to improve the routing efficiency. SmartBoa does not increase the capacity requirement for nodes when the system expands, so it can achieve higher scalability than the one-hop protocol. Furthermore, SmartBoa nodes can adjust its level at runtime, and thereby can warm up gradually when starting. This avoids the long-time initiation which is an important problem in one-hop overlay. In a word, SmartBoa is a general structure overlay network that can be deployed in any environments, not matter what the system size is, how dynamic the nodes are, and what the node-capacity distribution is like.

    Reference
    [1]Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Berkeley: Computer Science Division, 2001.
    [2]Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proc. of the Int'l Conf. on Distributed Systems Platforms 2001. http://research.microsoft.com/~antr/Pastry/
    [3]Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proc. of the SIGCOMM 2001.2001. http://www.acm.org/sigs/sigcomm/sigcomm2001 /
    [4]Cox R, Muthitacharoen A, Morris R. Serving DNS using chord. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002.http://www.cs.rice.edu/Conferences/IPTPS02/
    [5]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. 2003. http://www.usenix.org/events/usits03/
    [6]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. 2003. http://www.usenix.org/events/hotos03/
    [7]Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proc .of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies 2003. http://www.ieee-infocom.org/2003/
    [8]Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
    [9]Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
    [10]Gupta I, Birman K, Linga P, Demers A, van Renesse R. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议.软件学报,2005,16(5):991-999

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 03,2003
  • Revised:July 29,2004
You are the first2034815Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063