Abstract
In this paper, we design a new routing algorithm using SkipNet and Small-World for peer-to-peer system. The algorithm divides the routing space into two layers, SkipNet layer and Small-World layer. In the SkipNet layer, the routing method using numeric ID is discussed. In the Small-World layer, the routing method using small-world theoretical results is discussed. We also consider the dynamic circumstance-the node’s join and departure. The comparison of our algorithm with other algorithms is presented. Our algorithm supports content and path locality, it is very important for security consideration. In our algorithm, a few shortcuts to distant peers are inserted with some probabilities and the average path length is reduced. The preliminary simulation results show that our algorithm is efficient.
This paper is supported by SEC E-Institute: Shanghai High Institutions Grid project, the 863 high Technology Program of China (No. 2004AA104340 and No. 2004AA104280).Natural Science Foundation of China (No. 60433040 and No. 60473092).
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
Stoica, I., Morris, R., Karger, D., et al.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM 2001 (August 2001)
Ratnasamy, S., Francis, P., Handley, M., et al.: A Scalable Content-Addressable Network. In: Proceedings of ACM SIGCOMM (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November, pp. 329–350 (2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructure for Fault-Resilient Wide-area Location and Routing. Technical Report UCB//CSD-01-1141, UC Berkeley (April 2001)
Harvey, N.J.A., Jones, M.B., Saroiu, S., et al.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Fourth USENIX Symposium on Internet Technologies and Systems (USIT 2003), Seattle, WA (March 2003)
Aspnes, J., Shah, G.: Skip graphs. In: fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 384–393 (2003)
Pugh, W.: Skip Lists: A probabilistic Alternative to Balanced Trees. In: Workshop on Algorithms and Data Structures (1989)
Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Cornell Computer Science Technical Report, 99-1776 (2000)
Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature 393, 440 (1998)
Naor, M., Wieder, U.: Know thy Neighbor’s Neighbor: Better routing for skip-graphs and small worlds. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 269–277. Springer, Heidelberg (2005)
Zhou, J., Lu, H., Li, Y.D.: Using Small-World to Devise Routing Algorithm for Unstructured Peer-to-Peer System. Journal of Software 15(6) (2004)
Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer networks. In: Proceedings of the Int’l Conference on Distributed Computing Systems, pp. 5–14. IEEE Computer Society, Los Alamitos (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, X., Chen, L., Huang, L., Li, M. (2005). Routing Algorithm Using SkipNet and Small-World for Peer-to-Peer System. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_119
Download citation
DOI: https://doi.org/10.1007/11590354_119
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)