Abstract
One of the core problems of P2P computing is resource locating. The main research results of determined resource locating algorithms are four distributed hash table algorithms, i.e: CAN, Chord, Pastry and Tapestry. Based on these algorithms, this paper presents a hierarchical and manageable resource locating model (HMRLM) which can provide P2P networks with scalability and manageability.
This project is supported by 863 Foundation of China , grant no.2003AA142080
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.
Similar content being viewed by others
References
Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja1, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing. HP Laboratories Palo Alto HPL-2002-57
Napster, http://www.napster.com/
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. ACM SIGCOMM, San Diego, CA, August 2001, pp. 1161–1172 (2001)
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 SIGCOMM 2001 Conference, San Diego, California (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) (November 2001)
Zhao, B.Y., Kubiatowicz, J.D., Joseph, A.D.: Tapestry: An infrastructure for faultresilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley (April 2001)
Kazaa, http://www.kazaa.com/
Zhao, B.Y., Duan, Y., Huang, L., Joseph, A.D., Kubiatowicz, J.D.: Brocade: Landmark Routing on Overlay Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 34–44. Springer, Heidelberg (2002)
Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, May 1997, pp. 654–663 (1997)
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
Chen, H., Xu, C., Huang, Z., Hu, H., Gong, Z. (2004). A Scalable Peer-to-Peer Lookup Model. 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_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive