Abstract
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all peers, which is very inefficient. Recent researches utilize metadata or correlations of data and peers to steer search process, in order to make searching more purposeful and efficient. These efforts can be regarded as primitively taking advantage of Latent Semantics inhering in association of peers and data. In this paper, we introduce latent semantics analysis to peer-to-peer networks and demonstrate how it can improve searching efficiency. We characterize peers and data with latent semantic indexing (LSI) defined as K-dimensional vectors, which indicates the similarities and latent correlations in peers and data. We propose an efficient decentralized algorithm derived from maximizing-likelihood to automatically learn LSI from existing associations of peers and data (i.e. from (peer, data) pairs). In our simulations, searching efficiency can be greatly improved based on LSI, even with the simplest greedy search preference. Our approach is a framework to exploit inherent associations and semantics in peer-to-peer networks, which can be combined fundamentally with existing searching strategies and be utilized in most peer-to-peer applications.
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
Deerwester, S., Dumais, S.T., Furnas, G.W.: Indexing by latent semantic indexing. Journal of the American Society for Information Science
Wermter, S.: Neural Network Agent for Learning Semantic Text Classification. Journal of Information Retrieval 3(2) (2000)
Chris, H., Ding, Q.: A Similarity-based Probability Model for Latent Semantic Indexing. In: Proceeding of ACM SIGIR (1999)
Web traces and logs, http://www.web-caching.com/traces-logs.html
Kazaa, http://www.kazaa.com
Napster, http://www.napster.com
Gnutella, http://www.gnutella.com
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM (August 2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: ACM SIGCOMM (2001)
Freenet, http://freenet.sourceforge.com
FastTrack, http://www.fasttrack.nu
Cohen, E., Shenker, S.: Replication strategies in unstructured Peer-to-Peer networks. In: Proceedings of the ACM SIGCOMM (2002)
Crespo, A., et al.: Routing Indices for Peer-to-peer Systems. In: Proceeding of ICDCS (2002)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest- Based Locality in Peer-to-Peer Systems. In: Proceedings of the IEEE INFOCOM (2003)
Cohen, E., Fiat, A., Kaplan, H.: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In: Proceedings of the IEEE INFOCOM (2003)
Dumais, S.T.: Improving the retrieval of information from external sources. Behavior research Methods, Instruments and Computers (1991)
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
Liu, X., Chen, M., Yang, G. (2004). Latent Semantic Indexing in Peer-to-Peer Networks. In: Müller-Schloer, C., Ungerer, T., Bauer, B. (eds) Organic and Pervasive Computing – ARCS 2004. ARCS 2004. Lecture Notes in Computer Science, vol 2981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24714-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24714-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21238-6
Online ISBN: 978-3-540-24714-2
eBook Packages: Springer Book Archive