Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 48-63 |
Number of pages | 16 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 2944 |
State | Published - Dec 1 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)