GROUP: a gossip based building community protocol

Authors:
Ranieri Baraglia;Patrizio Dazzi;Matteo Mordacchini;Laura Ricci;Luca Alessi
Affiliations:
HPC Lab, ISTI-CNR, Italy;HPC Lab, ISTI-CNR, Italy;Ubiquitous Internet Lab, IIT-CNR, Italy;Dept. Computer Science, University of Pisa, Italy;Dept. Computer Science, University of Pisa, Italy
Venue:
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Year:
2011

Citing 11
Cited 0

The peer sampling service: experimental evaluation of unstructured gossip-based implementations

Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
A Distributed Approach to Node Clustering in Decentralized Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems
Semantic overlay networks

VLDB '05 Proceedings of the 31st international conference on Very large data bases
GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Gossip-based peer sampling

ACM Transactions on Computer Systems (TOCS)
Overlay Weaver: An overlay construction toolkit

Computer Communications
Semantic peer, here are the neighbors you want!

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Mendeley - A Last.fm For Research?

ESCIENCE '08 Proceedings of the 2008 Fourth IEEE International Conference on eScience
A P2P REcommender System based on Gossip Overlays (PREGO)

CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
The GOSSPLE anonymous social network

Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Epidemic-Style management of semantic overlays for content-based searching

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.