GROUP: A Gossip Based Building Community Protocol
The detection of communities of peers characterized by similar interests is currently a challenging research area. To ease the diffusion of relevant data to interested peers, similarity based overlays define links between similar peers by exploiting a similarity function. However, existing solutions neither give a clear definition of peer communities nor define a clear strategy to partition the peers into communities. As a consequence, the spread of the information cannot be confined within a well defined region of an overlay. This paper proposes a distributed protocol for the detection of communities in a P2P network. Our approach is based on the definition of a distributed voting algorithm where each peer chooses the more similar peers among those in a limited neighbourhood range. The identifier of the most representative peer is exploited to identify a community. The paper shows the effectiveness of our approach by presenting a set of experimental results.
KeywordsNetwork Size Similarity Degree Actual Representative Community Detection Algorithm Similar Node
Unable to display preview. Download preview PDF.
- 1.Aberer, K., Cudré-Mauroux, P.: Semantic overlay networks. In: Proc. of the Int. Conference on Very Large Data Bases, vol. 31, p. 1367. Citeseer (2005)Google Scholar
- 2.Bertier, Frey, Guerraoui, Kermarrec, Leroy: The Gossple Anonymous Social Network. In: Proc. of the ACM/IFIP/USENIX 11th Middleware Conference (Middleware 2010), pp. 814–829 (2010)Google Scholar
- 3.Jack, K., et al.: Mendeley’s reply to the DataTEL challenge. In: Proc. of the 1st Workshop on Recommender Systems for Technology Enhanced Learning (2010)Google Scholar
- 4.Guerraoui, R., Sidath, B.H., Kermarrec, A.M., Le Fessant, F., Huguenin, K., Rivière, E.: Gosskip, an efficient, fault-tolerant and self organizing overlay using gossip-based construction and skip-lists principles. In: Sixth IEEE International Conference on Peer-to-Peer Computing, 2006 Ratnasamy (2001)Google Scholar
- 5.Henning, V., Reichelt, J.: Mendeley-A Last. fm For Research? In: IEEE Fourth Int. Conference on eScience, 2008, pp. 327–328. IEEE, Los Alamitos (2009)Google Scholar
- 8.Mordacchini, M., Baraglia, R., Dazzi, P., Ricci, L.: A p2p recommender system based on gossip overlays (prego). In: CIT, pp. 83–90 (2010)Google Scholar
- 10.Ramaswamy, L., Gedik, B., Liu, L.: A distributed approach to node clustering in decentralized peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems, 814–829 (2005)Google Scholar