Lightweight probabilistic broadcast

The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong reliability guarantees against very good "scalability" properties. Scalability is in that context usually expressed in terms of throughput and delivery latency, but there is only little work on how to reduce the overhead of membership management on a large scale. The paper presents Lightweight Probabilistic Broadcast (lpbcast), a novel gossip-based broadcast algorithm which preserves the inherent throughput scalability of traditional gossip-based algorithms and adds a notion of membership management scalability: every process only knows a random subset of fixed size of the processes in the system. We formally analyze our broadcast algorithm in terms of scalability with respect to the size of individual views, and compare the analytical results both with simulations and concrete measurements.

[1]  Yair Amir,et al.  Membership Algorithms for Multicast Communication Groups , 1992, WDAG.

[2]  Sape Mullender,et al.  Distributed systems , 1989 .

[3]  Sape J. Mullender,et al.  Distributed systems (2nd Ed.) , 1993 .

[4]  Qixiang Sun,et al.  A gossip-based reliable multicast for large-scale high-throughput applications , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[5]  Patrick Th. Eugster,et al.  Distributed Asynchronous Collections: Abstractions for Publish/Subscribe Interaction , 2000, ECOOP.

[6]  David S. Rosenblum,et al.  Achieving scalability and expressiveness in an Internet-scale event notification service , 2000, PODC '00.

[7]  Robbert van Renesse,et al.  Efficient Buffering in Reliable Multicast Protocols , 1999, Networked Group Communication.

[8]  Richard A. Golding.  Weak consistency group communication for wide-area systems , 1992, [1992 Proceedings] Second Workshop on the Management of Replicated Data.

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

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

[11]  Marcos K. Aguilera,et al.  Matching events in a content-based subscription system , 1999, PODC '99.

[12]  Anne-Marie Kermarrec,et al.  Reliable probabilistic communication in large-scale information dissemination systems , 2000 .

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

[14]  Kenneth P. Birman,et al.  A randomized error recovery algorithm for reliable multicast , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Richard A. Golding,et al.  Weak-consistency group communication and membership , 1992 .

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

[17]  Keith Marzullo,et al.  Gossip versus Deterministically Constrained Flooding on Small Networks , 2000, DISC.

[18]  Luís E. T. Rodrigues,et al.  Semantically reliable multicast protocols , 2000, Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000.

[19]  Matti A. Hiltunen,et al.  Properties of membership services , 1995, Proceedings ISADS 95. Second International Symposium on Autonomous Decentralized Systems.

[20]  Rico Piantoni,et al.  Implementing the Swiss Exchange trading system , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[21]  Joshua S. Auerbach,et al.  Exploiting IP Multicast in Content-Based Publish-Subscribe Systems , 2000, Middleware.

[22]  Keith Marzullo,et al.  Directional Gossip: Gossip in a Wide Area Network , 1999, EDCC.

[23]  Robbert van Renesse,et al.  Optimizing buffer management for reliable multicast , 2002, Proceedings International Conference on Dependable Systems and Networks.

[24]  Louise E. Moser,et al.  Membership algorithms for asynchronous distributed systems , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

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

[26]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[27]  Robbert van Renesse,et al.  GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast , 1997 .

[28]  Gul A. Agha,et al.  Concurrent object-oriented programming , 1993, CACM.

[29]  Sanjoy Paul,et al.  Reliable Multicast Transport Protocol (RMTP) , 1997, IEEE J. Sel. Areas Commun..

[30]  Sandeep K. Singhal,et al.  Log-based receiver-reliable multicast for distributed interactive simulation , 1995, SIGCOMM '95.

[31]  Steven McCanne,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995, SIGCOMM '95.

[32]  Robbert van Renesse,et al.  Scalable and Secure Resource Location , 2000, HICSS.

[33]  Keith Marzullo,et al.  Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks , 1999 .

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

[35]  Luciano Baresi,et al.  Architectures for an Event Notification Service Scalable to Wide-area Networks , 2000 .