A Scalable Peer-to-Peer Network with Constant Degree

  • Dongsheng Li
  • Xinxin Fang
  • Yijie Wang
  • Xicheng Lu
  • Kai Lu
  • Nong Xiao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2834)

Abstract

Recently many distributed hash table (DHT) schemas have been proposed to build scalable peer-to-peer systems, in which degree and diameter are two important measures. In this paper, we propose Fission, a novel DHT-style peer-to-peer network, which is of constant degree and O(logN) diameter. Peers in Fission form an approximate Kautz topology and the “split large and merge small" policy is exploited to achieve load balance when peers join or depart. The performance of Fission is evaluated using both analysis and simulation. Formal proofs verify that the degree and the diameter of Fission are no more than O(1) and 2*logN respectively and the join or departure of one peer requires only O(1) peers to change their state. Simulations show that the load balance characteristic of Fission is good and the average path length of Fission is no more than logN.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clark, D.: Face-to-face with peer-to-peer networking. IEEE Computer 34(1), 18–21 (2001)Google Scholar
  2. 2.
    Schoder, D., Fischbach, K.: Peer-to-peer prospects. Communications of the ACM 46(2), 27–29 (2003)CrossRefGoogle Scholar
  3. 3.
    Stoica, I., Morris, R., Karger, D.: Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proc. of ACM SIGCOMM 2001, pp. 160–177. ACM Press, New York (2001)Google Scholar
  4. 4.
    Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proc. of 14th ACM Symp. on Parallel Algorithms and Architectures, SPAA (2002)Google Scholar
  5. 5.
    Rowstron, A., Druschel, P.: Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of IFIP/ACM Middleware 2000, Heidelberg, Germany, pp. 329–350 (2001)Google Scholar
  6. 6.
    Ratnasamy, S., Francis, P., Handley, M., et al.: A scalable content-addressable network. In: Proc. of ACM SIGCOMM 2001, pp. 149–160. ACM Press, New York (2001)Google Scholar
  7. 7.
    Plaxton, C., Rajaraman, R., Richa, A.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. of ACM Symp. on Parallel Algorithms and Architectures (SPAA), Newport, Rhode Island (1997)Google Scholar
  8. 8.
    Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Communication of the ACM 46(2), 43–48 (2003)CrossRefGoogle Scholar
  9. 9.
    Fraigniaud, P., Gauron, P.: The Content-Addressable Network D2B. Tech Rept. 1349, CNRS University paris-Sud, France (2003)Google Scholar
  10. 10.
    Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic lookup network. In: Proc. of 21st ACM Symp. on Principles of Distributed Computing (PODC), Monterey, CA (2002)Google Scholar
  11. 11.
    Kautz, W.H.: The design of optimum interconnection networks for multiprocessors. Architecture and design of Digital computer. NATO advances summer Institute, 249–277 (1969)Google Scholar
  12. 12.
    Panchapakesan, G., Sengupta, A.: On a lightwave Network Topology using Kautz Digraphs. IEEE Transaction on computers 48(10), 1131–1138 (1999)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Sivarajan, K.N., Ramaswami, R.: Lightwave Networks based on de Bruijn Graphs. IEEE/ACM Trans. Networking 2, 70–79 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dongsheng Li
    • 1
  • Xinxin Fang
    • 2
  • Yijie Wang
    • 1
  • Xicheng Lu
    • 1
  • Kai Lu
    • 1
  • Nong Xiao
    • 1
  1. 1.School of ComputerNational University of Defense TechnologyChangshaChina
  2. 2.Department of Compute science and technologyTongji UniversityShanghaiChina

Personalised recommendations