Abstract
Overlays to support applications, such as file sharing and media streaming services, are not only based on structured networks or unstructured networks simply. Gnutella networks with ultra-peers consider the strongpoint from above two kinds of traditional P2P networks. It is a very important open issue in the P2P networks that how to design a good lookup scheme with high performance. Traditional lookup schemes for unstructured networks, such as flooding technique and k-walker random walk, are all not very adaptive. In this paper, abundant statistics from realistic Gnutella networks are provided. All these data are used to prove that the ultra-peers are the important agents for other thousands of leaf peers. According to the conclusions from the statistics, one novel resource lookup scheme for P2P networks, called Lemming, has been proposed. The new scheme considers three aspects, latency, searching history, and the ultra-peers, which make great influence to the performance of searching. Simulations in the paper make some comparisons between flooding scheme, k-walker random walk and our Lemming scheme. Results from these simulations have proved that our Lemming scheme has good performances.
This paper is supported by National Hi-Tech R&D Project under grant No. 2002AA1Z2102.
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
Crespo, A., Garcia-Molina, H.: Routing Indices for Peer-to-Peer Systems. In: Proceedings of International Conference on Distributed Computing Systems, pp. 19–28 (2002)
Barabasi, L., Albert, R.: Emergence of scaling in random networks. Science 286, 509 (1999)
Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Lebofsky, M.: SETI@home: Massively Distributed Computing for SETI. Scientific Programming
Gnutella, http://www.gnutella.com/
Chen, H., Jin, H., Sun, J.: Analysis of large-scale topological properties for peer-topeer networks. In: Proceedings of CCGRID 2004 (2004)
Hsiao, H.C., King, C.T.: Similarity Discovery in Structured P2P Overlays. In: Proceedings of International conference on Parallel Processing (ICPP 2003) (October 2003)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Proceedings of Workshop on Design Issues in Anonymity and Unobservability, July 2000, pp. 311–320 (2000)
Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles, SOSP-19 (2003)
Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scalability, February 2001. O’Reilly’s, Sebastopol (2001), www.openp2p.com
Adamic, L.A., Humberman, B., Lukose, R., Puniyani, A.: Search in power law networks. Phys. Rev. E 64, 46135–46143 (2001)
Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the Kazaa Network. In: Proceedings of 3rd IEEE Workshop on Internet Applications, WIAPP 2003 (2003)
Napster Inc. The napster homepage. In, http://www.napster.com/
Ganesan, P., Sun, Q., Garcia-Molina, H.: YAPPERS: A Peer-to-Peer Lookup Service Over Arbitrary Topology. In: Proceedings of IEEE INFOCOM (March 2003)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of International Conference on Supercomputing, June 2002, pp. 84–95 (2002)
Albert, R., Jeong, H., Barabasi, A.L.: Topology of evolving networks: local events and universality. Phys. Rev. Lett. 85, 5234–5237 (2000)
Almeida, V., Bestavros, A., Crovella, M., de Oliveira, A.: Characterizing reference locality in the www. In: Proceedings of 1996 International Conference on parallel and Distributed Information Systems, PDIS 1996 (1996)
Liu, Y., Zhuang, Z., Xiao, L., Ni, L.M.: A Distributed Approach to Solving Overlay Mismatching Problem. In: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), Tokyo, Japan (March 2004)
Liu, Y., Liu, X., Xiao, L., Ni, L.M., Zhang, X.: Location-Aware Topology Matching in P2P Systems. In: Proceedings of IEEE INFOCOM 2004, Hong Kong, China (March 2004)
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
Liao, X., Jin, H., Chen, H. (2004). Lemming: A Novel Resource Lookup Scheme for Peer-to-Peer 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_98
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive