article

Lightweight probabilistic broadcast

Authors:

P. Th. Eugster,

S. B. Handurukande,

A.-M. KermarrecAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 21, Issue 4

Pages 341 - 374

https://doi.org/10.1145/945506.945507

Published: 01 November 2003 Publication History

Abstract

Gossip-based broadcast algorithms, a family of probabilistic broadcast algorithms, trade reliability guarantees against "scalability" properties. Scalability in this context has usually been expressed in terms of message throughput and delivery latency, but there has been little work on how to reduce the memory consumption for membership management and message buffering at large scale.This paper presents lightweight probabilistic broadcast (lpbcast), a novel gossip-based broadcast algorithm, which complements the inherent throughput scalability of traditional probabilistic broadcast algorithms with a scalable memory management technique. Our algorithm is completely decentralized and based only on local information: in particular, every process only knows a fixed subset of processes in the system and only buffers fixed "most suitable" subsets of messages. We analyze our broadcast algorithm stochastically and compare the analytical results both with simulations and concrete implementation measurements.

References

[1]

Aguilera, M., Strom, R., Sturman, D., Astley, M., and Chandra, T. 1999. Matching events in a content-based subscription system. In Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC '99).]]

[2]

Bailey, N. 1975. The Mathematical Theory of Infectious Diseases and its Applications (second edition). Hafner Press.]]

[3]

Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., and Minsky, Y. 1999. Bimodal multicast. ACM Trans. Comput. Syst. 17, 2 (May), 41--88.]]

[4]

Carzaniga, A., Rosenblum, D., and Wolf, A. 2000. Achieving scalability and expressiveness in an internet-scale event notification service. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC 2000). 219--227.]]

[5]

Deering, S. 1994. Internet multicasting. In ARPA HPCC 94 Symposium. Advanced Research Projects Agency Computing Systems Technology Office.]]

[6]

Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., and Terry, D. 1987. Epidemic algorithms for replicated database maintenance. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC'87). 1--12.]]

[7]

Eugster, P. T., Felber, P., Guerraoui, R., and Kermarrec, A.-M. 2001a. The many faces of publish/subscribe. Tech. Rep. DSC/2001/004, Swiss Federal Institute of Technology, Lausanne, http://dscwww.epfl.ch/EN/publications/.]]

[8]

Eugster, P. T., Guerraoui, R., and Sventek, J. 2000. Distributed Asynchronous Collections: Abstractions for publish/subscribe interaction. In Proceedings of the 14th European Conference on Object-Oriented Programming (ECOOP 2000). 252--276.]]

[9]

Eugster, P. T., Guerraoui, R., Handurukande, S. B., Kermarrec, A.-M., and Kouznetsov, P. 2001b. Lightweight probabilistic broadcast. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN 2001).]]

[10]

Eugster, P. T., Guerraoui, R., Kermarrec, A.-M., and Massoulie, L. 2003. From epidemics to distributed computing. IEEE Comput.]]

[11]

Golding, R. 1992. Weak consistency group communication for wide-area systems. In Proceedings of the Second Workshop on the Management of Replicated Data.]]

[12]

Hadzilacos, V. and Toueg, S. 1993. Distributed Systems, 2nd ed. Addison-Wesley, Chapter 5: Fault-Tolerant Broadcasts and Related Problems, 97--145.]]

[13]

Kermarrec, A.-M., Massoulié, L., and Ganesh, A. 2003. Probabilistic reliable dissemination in large-scale systems. IEEE Trans. Parallel Distrib. Syst. 14, 3 (March).]]

[14]

Kouznetsov, P., Guerraoui, R., Handurukande, S. B., and Kermarrec, A.-M. 2001. Reducing noise in gossip-based reliable broadcast. In Proceedings of the IEEE Symposium on Reliable Distributed Systems (SRDS 2001).]]

[15]

Lin, M.-J. and Marzullo, K. 1999. Directional gossip: Gossip in a wide area network. In European Dependable Computing Conference (EDCC). 364--379.]]

[16]

Lin, M.-J., Marzullo, K., and Masini, S. 2000. Gossip versus deterministically constrained flooding on small networks. In Proceedings of the International Conference on Distributed Computing (DISC 2000). 253--267.]]

[17]

Orlando, J., Rodrigues, L., and Oliveira, R. 2000. Semantically reliable multicast protocols. In Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS 2000).]]

[18]

Paul, S., Sabnani, K., Lin, J., and Bhattacharyya, S. 1997. Reliable multicast transport protocol (RMTP). IEEE J. Selected Areas Comm. 15, 3 (Apr.), 407--421.]]

[19]

Piantoni, R. and Stancescu, C. 1997. Implementing the Swiss exchange trading system. In Proceedings of The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing (FTCS '97). 309--313.]]

[20]

Rodrigues, L., Handurukande, S., Pereira, J., Guerraoui, R., and Kermarrec, A.-M. 2003. Adaptive gossip-based broadcast. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN 2003).]]

[21]

Sun, Q. and Sturman, D. 2000. A gossip-based reliable multicast for large-scale high-throughput applications. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN2000). New York, USA.]]

[22]

TIBCO. 1999. TIB/Rendezvous White Paper. http://www.rv.tibco.com/.]]

[23]

van Renesse, R. 2000. Scalable and secure resource location. In Proceedings of the IEEE Hawaii International Conference on System Sciences.]]

[24]

Xiao, Z. and Birman, K. 2001. Randomized error recovery algorithm for reliable multicast. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM).]]

[25]

Xiao, Z., Birman, K., and van Renesse, R. 2002. Optimizing buffer management for reliable multicast. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN2002).]]

Cited By

Barroso-Fernández CJiménez ELópez-Presa JMoreno-Cuesta MXulvi-Brunet R(2024)Optimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery ConstraintsIEEE Access10.1109/ACCESS.2023.334902112(4701-4715)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3349021
Frey DMostefaoui APerrin MRoman PTaïani F(2023)Differentiated Consistency for Worldwide GossipsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.320915034:1(1-15)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TPDS.2022.3209150
Antonov AVoulgaris S(2023)SecureCyclon: Dependable Peer Sampling2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00041(1-12)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00041
Show More Cited By

Index Terms

Lightweight probabilistic broadcast
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications

Recommendations

Araneola: A scalable reliable multicast system for dynamic environments

This paper presents Araneola (Araneola means ''little spider'' in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully ...
Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination

We consider buffer management in support of large-scale gossip-based peer-to-peer data dissemination protocols. Coupled with an efficient buffering mechanism, system-wide buffer usage can be optimized while providing reliability and scalability in such ...
Cost-effective broadcast for fully decentralized peer-to-peer networks

Fully unstructured and decentralized peer-to-peer networks such as Gnutella are appealing for a variety of applications, among which file-sharing is the most prominent one. The decentralized nature of these systems provides a high degree of robustness ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 21, Issue 4

November 2003

104 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/945506

Issue’s Table of Contents

Copyright © 2003 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 2003

Published in TOCS Volume 21, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

302
Total Citations
View Citations
2,359
Total Downloads

Downloads (Last 12 months)47
Downloads (Last 6 weeks)9

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Barroso-Fernández CJiménez ELópez-Presa JMoreno-Cuesta MXulvi-Brunet R(2024)Optimizing Gossiping for Asynchronous Fault-Prone IoT Networks With Memory and Battery ConstraintsIEEE Access10.1109/ACCESS.2023.334902112(4701-4715)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2023.3349021
Frey DMostefaoui APerrin MRoman PTaïani F(2023)Differentiated Consistency for Worldwide GossipsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.320915034:1(1-15)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TPDS.2022.3209150
Antonov AVoulgaris S(2023)SecureCyclon: Dependable Peer Sampling2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00041(1-12)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00041
Vaz DMatos DPardal MCorreia M(2023)Synthesis of Fault-Tolerant Reliable Broadcast Algorithms With Reinforcement LearningIEEE Access10.1109/ACCESS.2023.328740511(62394-62408)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3287405
Gharat NJolly L(2023)Source Location Privacy Protection Algorithms in IoT Networks: A SurveySoft Computing for Security Applications10.1007/978-981-99-3608-3_55(793-812)Online publication date: 20-Jul-2023
https://doi.org/10.1007/978-981-99-3608-3_55
Gurcan O(2022)Proof of Work Is a Stigmergic Consensus Algorithm: Unlocking Its PotentialIEEE Robotics & Automation Magazine10.1109/MRA.2022.316574529:2(21-32)Online publication date: Jun-2022
https://doi.org/10.1109/MRA.2022.3165745
Pigaglio MBruneau-Queyreix JBromberg YFrey DRiviere EReveillere L(2022)RAPTEE: Leveraging trusted execution environments for Byzantine-tolerant peer sampling services2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS54860.2022.00064(603-613)Online publication date: Jul-2022
https://doi.org/10.1109/ICDCS54860.2022.00064
Tumas VRivera SMagoni DState R(2022)Probabilistic Edge Multicast Routing for the XRP NetworkGLOBECOM 2022 - 2022 IEEE Global Communications Conference10.1109/GLOBECOM48099.2022.10000650(5129-5134)Online publication date: 4-Dec-2022
https://doi.org/10.1109/GLOBECOM48099.2022.10000650
Wang XJiang BLi B(2022)Opinion dynamics on social networksActa Mathematica Scientia10.1007/s10473-022-0616-842:6(2459-2477)Online publication date: 10-Oct-2022
https://doi.org/10.1007/s10473-022-0616-8
Cason DMilosevic NMilosevic ZPedone FZhang KGherbi AVenkatasubramanian NVeiga L(2021)Gossip consensusProceedings of the 22nd International Middleware Conference10.1145/3464298.3493395(198-209)Online publication date: 6-Dec-2021
https://dl.acm.org/doi/10.1145/3464298.3493395
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents