Abstract
Peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, lead to high latency and low efficiency because they are independent of underlying physical networks. A well-routed lookup path in an overlay network with a small number of logical hops can result in a long delay and excessive traffic due to undesirably long distances in some physical links. In these DHT-based P2P systems, each data item is associated with a key and the key/value pair is stored in the node to which the key maps, not considering the data semantic. In this paper, we propose an effective P2P routing algorithm, called Uinta, to adaptively construct a structured P2P overlay network. Uinta not only takes advantages of physical characteristics of the network, but also places data belonging to the same semantic into a cluster and employs a class cache scheme to reduce the lookup routing latency. Simulations make some comparisons between Chord and our Uinta algorithm all running on the GT-ITM transit stub topology. The results show Uinta routing algorithm significantly improves P2P system lookup performance.
This work is supported by National Science Foundation of China under grant No.60433040.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gnutella, http://www.gnutellaforums.com/
KazaA, http://www.kazaa.com
Freenet, http://freenet.sourceforge.net/
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM) (August 2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of the 2003 ACM Special Interest Group on Data Communication (SIGCOMM) (August 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22, 41–53 (2004)
Shin, K., Lee, S., Lim, G., Yoon, H., Ma, J.S.: Grapes: Topology-based Hierarchical Virtual Network for Peer-to-peer Lookup Services. In: Proceedings of the International Conference on Parallel Processing Workshops, ICPPW 2002 (2002)
Xu, Z., Min, R., Hu, Y.: HIERAS:A DHT-Based Hierarchical Peer-to-Peer Routing Algorithm. In: Proceedings of the 2003 International Conference on Parallel Processing (ICPP 2003), October 2003, pp. 187–194 (2003)
Mahanti, A.: Web proxy workload characterisation and modelling. Master’s Thesis, Department of Computer Science, University of Saskatchewan (September 1999)
Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM (2003)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-aware overlay construction and server selection. In: Proceedings of IEEE INFOCOM 2002, New York (June 2002)
Karger, D.R., Lehman, E., Leighton, F., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 654–663 (1997)
Kubiatowicz, J., Bindel, D., Eaton, P., Chen, Y., Geels, D., Gummadi, R., Rhea, S., Weimer, W., Wells, C., Weatherspoon, H., Zhao, B.: OceanStore: An architecture for global-scale persistent storage. In: Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), Cambridge, MA, November 2000, pp. 190–201 (2000)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-Area Cooperative Storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Banff, Alberta, Canada, October 2001, pp. 202–215 (2001)
Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to model an internet work. In: Proceedings of IEEE INFOCOM (1996)
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
Jin, H., Xu, J., Zou, B., Zhang, H. (2005). Uinta: A P2P Routing Algorithm Based on the User’s Interest and the Network Topology. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_27
Download citation
DOI: https://doi.org/10.1007/11603771_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)