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.
This work was supported by National Natural Science Foundation of China under the grant No. 69933030, 60203016 and 90104001, Excellent PHD Dissertation Foundation of China under the grant No. 200141 and National 863 High Technology Plan of China under the grant No. 2002AA131010.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Clark, D.: Face-to-face with peer-to-peer networking. IEEE Computer 34(1), 18–21 (2001)
Schoder, D., Fischbach, K.: Peer-to-peer prospects. Communications of the ACM 46(2), 27–29 (2003)
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)
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)
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)
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)
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)
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)
Fraigniaud, P., Gauron, P.: The Content-Addressable Network D2B. Tech Rept. 1349, CNRS University paris-Sud, France (2003)
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)
Kautz, W.H.: The design of optimum interconnection networks for multiprocessors. Architecture and design of Digital computer. NATO advances summer Institute, 249–277 (1969)
Panchapakesan, G., Sengupta, A.: On a lightwave Network Topology using Kautz Digraphs. IEEE Transaction on computers 48(10), 1131–1138 (1999)
Sivarajan, K.N., Ramaswami, R.: Lightwave Networks based on de Bruijn Graphs. IEEE/ACM Trans. Networking 2, 70–79 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, D., Fang, X., Wang, Y., Lu, X., Lu, K., Xiao, N. (2003). A Scalable Peer-to-Peer Network with Constant Degree. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-39425-9_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20054-3
Online ISBN: 978-3-540-39425-9
eBook Packages: Springer Book Archive