Lightweight, efficient, robust epidemic dissemination

Abstract Today’s intensive demand for data such as live broadcast or news feeds requires efficient and robust dissemination systems. Traditionally, designs focus on extremes of the efficiency/robustness spectrum by either using structures, such as trees for efficiency or by using loosely-coupled epidemic protocols for robustness. We present Brisa , a hybrid approach combining the robustness of epidemics with the efficiency of structured approaches. Brisa implicitly emerges embedded dissemination structures from an underlying epidemic substrate. The structures’ links are chosen with local knowledge only, but still ensuring connectivity. Failures can be promptly compensated and repaired thanks to the epidemic substrate, and their impact on dissemination delays masked by the use of multiple independent structures. Besides presenting the protocol design, we conduct an extensive evaluation in real environments, analyzing the effectiveness of the structure creation mechanism and its robustness under dynamic conditions. Results confirm Brisa as an efficient and robust approach to data dissemination in large dynamic environments.

[1]  Roberto Beraldi,et al.  TERA: topic-based event routing for peer-to-peer architectures , 2007, DEBS '07.

[2]  Anne-Marie Kermarrec,et al.  Stretching gossip with live streaming , 2009, 2009 IEEE/IFIP International Conference on Dependable Systems & Networks.

[3]  Maarten van Steen,et al.  Hybrid Dissemination: Adding Determinism to Probabilistic Multicasting in Large-Scale P2P Systems , 2007, Middleware.

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

[5]  Márk Jelasity,et al.  A Robust and Scalable Peer-to-Peer Gossiping Protocol , 2003, AP2PC.

[6]  Kai Hwang,et al.  Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[7]  João Leitão,et al.  HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[8]  Márk Jelasity,et al.  Chord on demand , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[9]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[10]  H BloomBurton.  Space/time trade-offs in hash coding with allowable errors , 1970 .

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

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

[13]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[14]  Idit Keidar,et al.  Araneola: a scalable reliable multicast system for dynamic environments , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[15]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[16]  Zhongcheng Li,et al.  Towards reliable and efficient data dissemination in heterogeneous peer-to-peer systems , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[17]  Indranil Gupta,et al.  MON: On-Demand Overlays for Distributed System Management , 2005, WORLDS.

[18]  João Leitão,et al.  Thicket: A Protocol for Building and Maintaining Multiple Trees in a P2P Overlay , 2010, 2010 29th IEEE Symposium on Reliable Distributed Systems.

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

[20]  Chunqiang Tang,et al.  GoCast: gossip-enhanced overlay multicast for fast and dependable group communication , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[21]  Valerio Schiavoni,et al.  BRISA: Combining Efficiency and Reliability in Epidemic Data Dissemination , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.

[22]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[23]  Márk Jelasity,et al.  T-Man: Gossip-based fast overlay topology construction , 2009, Comput. Networks.

[24]  Ming Zhou,et al.  Tree-assisted gossiping for overlay video distribution , 2006, Multimedia Tools and Applications.

[25]  Zongming Fei,et al.  A Proactive Tree Recovery Mechanism for Resilient Overlay Multicast , 2007, IEEE/ACM Transactions on Networking.

[26]  Miguel Castro,et al.  Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..

[27]  Paul Francis,et al.  Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[28]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[29]  Miguel Castro,et al.  SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.

[30]  Christopher Chute,et al.  The Diverse and Exploding Digital Universe , 2011 .

[31]  Anne-Marie Kermarrec,et al.  Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems , 2009, Comput. Networks.

[32]  João Leitão,et al.  Epidemic Broadcast Trees , 2007, 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007).

[33]  Boris Koldehofe,et al.  Buffer management in probabilistic peer-to-peer communication protocols , 2003, 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings..

[34]  Anne-Marie Kermarrec,et al.  SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication , 2001, Networked Group Communication.

[35]  Pascal Felber,et al.  SPLAY: Distributed Systems Evaluation Made Simple (or How to Turn Ideas into Live Systems in a Breeze) , 2009, NSDI.

[36]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[37]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

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