Advertisement

Improvement of Routing Structure in P2P Overlay Networks

  • Jinfeng Hu
  • Yinghui Wu
  • Ming Li
  • Weimin Zheng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3032)

Abstract

Although peer-to-peer overlays have been elaborately studied, they still have redundant overheads. Pastry and Chord use leaf sets to connect those nodes contiguous in numerical space, but these pointers have no contribution to efficient routing. In this paper we argue that if the mapping between a message key and its root node is determined in a smart way, leaf sets can be removed, largely decreasing system overheads. We present a novel overlay algorithm derived from Pastry, in which nodeIds have different lengths and form a Huffman set, routing tables have no empty items and root node exactly prefix-matching its keys. By these means, our approach abolishes the leaf sets with no ill effect on routing performance or other properties. Experimental results show that our approach saves about 22~25% messages cost for maintenance in comparison with Pastry in an overlay of 10,000 peers.

Keywords

overlay networks peer-to-peer substrate routing protocol 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: SIGCOMM 2001 (2001)Google Scholar
  2. 2.
    Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. Middleware (2001)Google Scholar
  3. 3.
    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 (2001)Google Scholar
  4. 4.
    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 (April 2001)Google Scholar
  5. 5.
    Mahajan, R., Castro, M., Rowston, A.: Controlling the Cost of Reliability in Peer-to-Peer Overlays. In IPTPS 2003 (2003)Google Scholar
  6. 6.
    Castro, M., Druschel, P., Hu, Y.C., Rowstron, A.: Exploiting network proximity in peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research (May 2002)Google Scholar
  7. 7.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to- Peer File Sharing Systems. In: MMCN 2002 (2002)Google Scholar
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jinfeng Hu
    • 1
  • Yinghui Wu
    • 1
  • Ming Li
    • 1
  • Weimin Zheng
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations