JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles

Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in number of messages that are received at different nodes. This paper presents techniques that leverage simple social network principles enabling nodes to select gossip targets intelligently. The simple heuristics presented in the paper achieve a more uniform message overhead at each node, lowering the system-wide gossip traffic, while simultaneously reducing the latency of gossip spread (by up to 25%). We experimentally compare our system, called JetStream, against canonical gossip as well as gossip on the chord overlay. Intuitively, JetStream seeks to make gossip spread more deterministic and predictable, while still inheriting its scale and reliability. JetStream also provides an added benefit by reducing network bandwidth utilization with a low sustained rate of gossip injection

[1]  Daniel J. Brass.  A social network perspective on human resources management , 1992 .

[2]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[3]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[4]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[5]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[6]  Anne-Marie Kermarrec,et al.  Reducing noise in gossip-based reliable broadcast , 2001, Proceedings 20th IEEE Symposium on Reliable Distributed Systems.

[7]  Anne-Marie Kermarrec,et al.  Probabilistic semantically reliable multicast , 2001, Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001.

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

[9]  Abhinandan Das,et al.  SWIM: scalable weakly-consistent infection-style process group membership protocol , 2002, Proceedings International Conference on Dependable Systems and Networks.

[10]  Anne-Marie Kermarrec,et al.  Efficient epidemic-style protocols for reliable and scalable multicast , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[11]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[12]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[13]  Amin Vahdat,et al.  Bullet: high bandwidth data dissemination using an overlay mesh , 2003, SOSP '03.

[14]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[15]  Shlomo Zilberstein,et al.  Adaptive Peer Selection , 2003, IPTPS.

[16]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[17]  Peter R. Monge,et al.  Theories of Communication Networks , 2003 .

[18]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[19]  Hector Garcia-Molina,et al.  DHT Routing Using Social Links , 2004, IPTPS.

[20]  Peter Druschel,et al.  FeedTree: Sharing Web Micronews with Peer-to-Peer Event Notification , 2005, IPTPS.

[21]  Fifth IEEE International Symposium on Network Computing and Applications, NCA 2006, 24-26 July 2006, Cambridge, Massachusetts, USA , 2006, NCA.

[22]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.