Abstract
Various DHT routing algorithms have been proposed in recent years. All these algorithms have tried to keep an uniform structured geometry while nodes join and leave. In this paper, we use links to capture the dynamic characteristics of the geometry and suggest there are three kinds of links in the geometry: the basic short link, the redundant short link, and the long links. Several current DHT systems have been investigated to argue these links are inherent in them and pointed out the possible improved directions of performance based on the characteristics of links. We analyze how links impact the routing performance and observe it with simulation experiments. Our experimental results show that each kind of links has its special contribution to the performance of P2P systems and it needs to take the effect of links into account as designing DHT routing algorithms.
Research described in this paper is supported by The Science & Technology Committee of Shanghai Municipality Key Technologies R&D Project Grant 03dz15027 and by The Science & Technology Committee of Shanghai Municipality Key Project Grant 025115032.
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
De Bruijn, N.: Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem. Indag. Math. 34(5), 381–392 (1972)
Gnutella, http://www.gnutella.co.uk
Ratnaswamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: ACM SIGCOMM (2001)
Stoica, R., Morris, D., Karger, F.: Kaashoek, and H. Balakrishnan. Chord: A peer-to-peer lookup service for internet applications. In: ACM SIGCOMM (2001)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: Adistributed anonymous information storage and retrieval system in designing privacy enhancing echnologies. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)
Zhao, B., Kubiatowicz, K., Joseph, A.: Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, University of California at Berkeley (April 2001)
Frans Kaashoek, M., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zou, F., Zhang, L., Li, Y., Ma, F. (2004). Effect of Links on DHT Routing Algorithms. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive