Abstract
In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding tends to be very expensive. We propose that node connections be influenced by content, so that for example, nodes having many “Jazz” files will connect to other similar nodes. Thus, semantically related nodes form a Semantic Overlay Network (SON). Queries are routed to the appropriate SONs, increasing the chances that matching files will be found quickly, and reducing the search load on nodes that have unrelated content. We have evaluated SONs by using an actual snapshot of music-sharing clients. Our results show that SONs can significantly improve query performance while at the same time allowing users to decide what content to put in their computers and to whom to connect.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIG-COMM (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content- addressable network. In: ACM SIGCOMM (2001)
Crespo, A., Garcia-Molina, H.: Semantic overlay networks for p2p systems. Technical report, Stanford University (2003), At http://dbpubs.stanford.edu/pub/2003-75
Kossman, D.: The state of the art in distributed queyr processing. In: ACM Computing Survey (2000)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: ASPLOS (2000)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and rout-ing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, U. C. Berkeley (2001)
Manning, C., Schutze, H.: Foundations of statistical natural language processing. In: Semantic Overlay Networks for P2P Systems, vol. 13, The MIT Press, Cambridge (1999)
Sahami, M., Baldonado, S.Y.M.: Sonia: A service for organizing networked infor- mation autonomously. In: Proceedings of the Third ACM Conference on Digital Libraries (1998)
Nejdl, W., Siberski, W., Wolpers, M., Schmitz, C.: Routing and clustering in schema-based super peer networks
http://www.napster.com (Napster)
http://opennap.sourceforge.net (OpenNap)
Baeza-Yates, R.: Modern Information Retrieval. Addison Wesley, Reading (1999)
Rich, E., Knight, K.: Artificial Intelligence. McGraw-Hill Inc., New York (1991)
Witten, I., Frank, E.: Data Mining. Morgan Kaufmann Publishers, San Francisco (1999)
http://www.allmusic.com (All Music Guide)
Yang, B., Garcia-Molina, H.: Comparing hybrid peer-to-peer systems. In: Proceedings of the Tweenty-First International Conference on Very Large Databases, VLDB 2001 (2001)
Korfhage, R.: Information storage and retrieval. Wiley Computer Publishing, Chichester (1997)
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
Crespo, A., Garcia-Molina, H. (2005). Semantic Overlay Networks for P2P Systems. In: Moro, G., Bergamaschi, S., Aberer, K. (eds) Agents and Peer-to-Peer Computing. AP2PC 2004. Lecture Notes in Computer Science(), vol 3601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11574781_1
Download citation
DOI: https://doi.org/10.1007/11574781_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29755-0
Online ISBN: 978-3-540-31657-2
eBook Packages: Computer ScienceComputer Science (R0)