Abstract
In this paper, we propose a scheme to dynamically establish shortcut links in Content Addressable Networks (CAN), based on a probabilistic method suggested by Kleinberg in 2000. The proposed scheme consists of the following three steps: 1) estimation of the total number of nodes participating to the P2P system, 2) dynamic adjustment of the probability distribution for selecting the target point of shortcut based on the estimated number, and 3) the establishment of shortcut to the nodes corresponding to the selected points. The performance of the resulting scheme is evaluated by simulation. The result of simulations implies that the shortcut significantly reduces the average number of hop counts, and the rate of improvement increases as increasing the number of nodes; e.g., the proposed method improves the hop counts in conventional CAN by 49% when it contains 4096 nodes. In addition, dynamic adjustment of the probability distribution improves the performance of the overall scheme, although the amount of improvement is less than “one hop” for relatively small netwotks examined in the simulation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: ICSI workshop on Design Issues in Anonymity and Unobsevability, pp. 46–66 (July 2000)
Gnutella, http://gnutella.wego.com/
Kleinberg, J.: Small-World Phenomena and the Dynamics of Information. NIPS (2001)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. of 32nd ACM Symposium on Theory of Computing (2000)
Kleinberg, J.: Navigation in a small world. Nature 406, 845 (2000)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the ACM SIGCOMM 2001 Technical Conference, August 2001, pp. 161–172 (2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level multicast using content-addressable networks. In: Proceedings of the Third International Workshop on Networked Group Communication, November 2001, pp. 14–29 (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of the ACM SIGCOMM 2001 Technical Conference, August 2001, pp. 149–160 (2001)
Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Faulttolerant Wide-area Location and Routing. UCB/CSD-01-1141 (April 2000)
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
Ohtsubo, A., Takemoto, D., Tagashira, S., Fujita, S. (2004). The Power of Shortcuts in Greedy Routing in Content Addressable Networks. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_95
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive