Advertisement

Twins: 2-hop Structured Overlay with High Scalability

  • Jinfeng Hu
  • Haitao Dong
  • Weimin Zheng
  • Dongsheng Wang
  • Ming Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3036)

Abstract

How to build an efficient P2P overlay network on a large-scale system is still in the air. Pastry-like p2p overlays have low maintenance costs because of their log(N)-sized routing tables. However their lookup efficiency is quite low. One-hop overlays, although having high routing efficiency, can not scale to large systems because of its high maintenance cost. In this paper, we present a novel structured overlay network, Twins. Routing in Twins can be accomplished in 2 hops in very high probability. With a report-based multicast maintenance algorithm, the overlay network consumes very low maintenance cost in presence of large-scale and highly dynamic network environments. The experimental results indicate that, when the system running over a network of 5,000,000 peers, each peer consumes only 6 messages per second for maintenance, and the routing latency is only 2 hops in a very high probability of 0.99.

Keywords

Overlay Network Structure Overlay Route Table Overlay Node Overlay Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Gupta, A., Liskov, B., Rodrigues, R.: One Hop Lookups for Peer-to-Peer Overlays. In: HOTOS IX (May 2003)Google Scholar
  2. 2.
    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: IPTPS 2003 (February 2003)Google Scholar
  3. 3.
    Kazaa, http://www.kazaa.com (November 2003)
  4. 4.
    Maymounkov, P., Mazieres, D.: Kademlia: A Peer-to-peer Information System Based on the XOR Metric. In: IPTPS 2002 (March 2002)Google Scholar
  5. 5.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content- Addressable Network. In: SIGCOMM 2001 (August 2001)Google Scholar
  6. 6.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  7. 7.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: MMCN 2002 (January 2002)Google Scholar
  8. 8.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001 (August 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jinfeng Hu
    • 1
  • Haitao Dong
    • 1
  • Weimin Zheng
    • 1
  • Dongsheng Wang
    • 1
  • Ming Li
    • 1
  1. 1.Computer Science and Technology DepartmentTsinghua UniversityBeijingChina

Personalised recommendations