On churn and communication delays in social overlays

Peer-to-peer systems based on an overlay network that mirrors the social relationships among the nodes' owners are increasingly attracting interest. Yet, the churn induced by the availability of users raises the question-still unanswered-of whether these social overlays represent a viable solution. Indeed, although constraining communication to take place only among “friends” brings many benefits, it also introduces significant limitations when healing the overlay in the presence of churn. This paper puts forth two contributions. First, we show through simulation on real datasets that churn induces relevant delays in information dissemination, which may ultimately hamper the practical application of social overlays. Yet, identifying opportunities for improvement and evaluating design alternatives through simulation is impractical, due to the size of the target networks, the large parameter space, and the many sources of randomness involved. Therefore, in our second contribution we combine analytical and simulation techniques to enable the estimation of dissemination delays at a practical cost.

[1]  Pietro Michiardi,et al.  Data transfer scheduling for P2P storage , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

[2]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[3]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[4]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[5]  Rajesh Sharma,et al.  GoDisco: Selective Gossip Based Dissemination of Information in Social Community Based Overlays , 2011, ICDCN.

[6]  Alberto Montresor,et al.  Efficient dissemination in decentralized social networks , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

[7]  K. Berman.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[8]  Laurent Massoulié,et al.  The diameter of opportunistic mobile networks , 2007, CoNEXT '07.

[9]  Kenneth A. Berman,et al.  Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.

[10]  Dmitri Loguinov,et al.  Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[11]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[12]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, STOC '00.

[13]  George S. Fishman,et al.  How heavy-tailed distributions affect simulation-generated time averages , 2006, TOMC.

[14]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[15]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[16]  Taoufik En-Najjary,et al.  A global view of kad , 2007, IMC '07.