Interest-based communities are a natural arrangement of distributed systems that prune the search space and allow for better dissemination of information to participating peers. In this paper, we introduce the notion of peer communities. Communities are like interest groups, modeled after human communities and can overlap. Our work focuses on providing efficient formation, discovery and management techniques that can be implemented to constantly changing community structures. We provide a mechanism to generate realistic peer-to-peer network topologies that can be used in simulations that evaluate the operation of our algorithms. Our experiments show how searching the peer-to-peer network can take advantage of peer communities to reduce the number of messages and improve the quality of search results. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Khambatti, M., Ryu, K. D., & Dasgupta, P. (2004). Structuring peer-to-peer networks using interest-based communities. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2944, 48–63. https://doi.org/10.1007/978-3-540-24629-9_5
Mendeley helps you to discover research relevant for your work.