On Democracy in Peer-to-Peer systems

The information flow inside a P2P network is highly dependent on the network structure. In order to ease the diffusion of relevant data toward interested peers, many P2P protocols gather similar nodes by putting them in direct contact. With this approach the similarity between nodes is computed in a point-to-point fashion: each peer individually identifies the nodes that share similar interests with it. This leads to the creation of a sort of "private" communities, limited to each peer neighbors list. This "private" knowledge do not allow to identify the features needed to discover and characterize the correlations that collect similar peers in broader groups. In order to let these correlations to emerge, the collective knowledge of peers must be exploited. One common problem to overcome in order to avoid the "private" vision of the network, is related to how distributively determine the representation of a community and how nodes may decide to belong to it. We propose to use a gossip-like approach in order to let peers elect and identify leaders of interest communities. Once leaders are elected, their profiles are used as community representatives. Peers decide to adhere to a community or another by choosing the most similar representative they know about.

[1]  Nitin H. Vaidya,et al.  Leader election algorithms for mobile ad hoc networks , 2000, DIALM '00.

[2]  Stefano Lodi,et al.  Semantic peer, here are the neighbors you want! , 2008, EDBT '08.

[3]  Anne-Marie Kermarrec,et al.  GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[4]  Raffaele Perego,et al.  Peer-to-Peer Clustering of Web-browsing Users , 2009, LSDS-IR@SIGIR.

[5]  Laura Ricci,et al.  A P2P REcommender System based on Gossip Overlays (PREGO) , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.

[6]  Suresh Jagannathan,et al.  Randomized leader election , 2007, Distributed Computing.

[7]  Karl Aberer,et al.  Semantic Overlay Networks , 2005, VLDB.

[8]  Kazuyuki Shudo,et al.  Overlay Weaver: An overlay construction toolkit , 2008, Computer Communications.

[9]  Victor Henning,et al.  Mendeley - A Last.fm For Research? , 2008, 2008 IEEE Fourth International Conference on eScience.

[10]  Konrad Iwanicki,et al.  Proactive gossip-based management of semantic overlay networks: Research Articles , 2007 .

[11]  Anne-Marie Kermarrec,et al.  The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations , 2004, Middleware.

[12]  Lakshmish Ramaswamy,et al.  A distributed approach to node clustering in decentralized peer-to-peer networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[13]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[14]  Pattie Maes,et al.  Social information filtering: algorithms for automating “word of mouth” , 1995, CHI '95.

[15]  Anne-Marie Kermarrec,et al.  The Gossple Anonymous Social Network , 2010, Middleware.

[16]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[17]  Maarten van Steen,et al.  Epidemic-Style Management of Semantic Overlays for Content-Based Searching , 2005, Euro-Par.