Abstract
A lot of recent research on content-based P2P searching for file- sharing applications has focused on exploiting semantic relations between peers to facilitate searching. To the best of our knowledge, all methods proposed to date suggest reactive ways to seize peers’ semantic relations. That is, they rely on the usage of the underlying search mechanism, and infer semantic relations based on the queries placed and the corresponding replies received. In this paper we follow a different approach, proposing a proactive method to build a semantic overlay. Our method is based on an epidemic protocol that clusters peers with similar content. It is worth noting that this peer clustering is done in a completely implicit way, that is, without requiring the user to specify his preferences or to characterize the content of files he shares.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Risson, J., Moors, T.: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods. Technical Report UNSW-EE-P2P-1-1, University of New South Wales, Sydney, Australia (September 2004)
Albert, R., Barabasi, A.-L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47–97 (2001)
Newman, M.E.J.: Random Graphs as Models of Networks. In: Bornholdt, S., Schuster, H.G. (eds.) Handbook of Graphs and Networks: From the Genome to the Internet, Â ch.2, John Wiley, New York (2002)
Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol. 3231, Springer, Heidelberg (2004)
Le Fessant, F., Handurukande, S., Kermarrec, A.-M., MassouliéClustering, L.: in peer-to-peer file sharing workloads. In: 3rd International Workshop on Peer-to-Peer Systems (IPTPS), San Diego, USA (February 2004)
Watts, D.J.: Small Worlds, The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)
Voulgaris, S., Gavidia, D., van Steen, M.: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management (2005) (to appear)
Jelasity, M., Babaoglu, O.: T-Man: Fast gossip-based construction of large-scale overlay topologies. Technical Report UBLCS-2004-7, University of Bologna, Department of Computer Science, Bologna, Italy (May 2004)
Peersim, http://peersim.sourceforge.net/
edonkey, http://www.edonkey2000.com
Handurukande, S., Kermarrec, A.-M., Le Fessant, F., Massoulié, L.: Exploiting semantic clustering in the edonkey p2p network. In: 11th ACM SIGOPS European Workshop (SIGOPS), Leuven, Belgium (September 2004)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: INFOCOM Conference (2003)
Voulgaris, S., Kermarrec, A., Massoulié, L., van Steen, M.: Exploiting semantic proximity in peer-to-peer content searching. In: 10th International Workshop on Future Trends in Distributed Computing Systems (FTDCS 2004), Suzhu, China (November 2001)
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
Voulgaris, S., van Steen, M. (2005). Epidemic-Style Management of Semantic Overlays for Content-Based Searching. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_125
Download citation
DOI: https://doi.org/10.1007/11549468_125
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)