Skip to main content
Log in

Reliability versus cost: Design of a probabilistic broadcast algorithm

  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary

We propose a probabilistic algorithm to solve the problem of distributed broadcast. A simple diffusion algorithm is introduced, and its reliability is evaluated. The cost and reliability of the probabilistic algorithm are compared with the corresponding deterministic algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Birrell AD, Nelson BJ: Implementing remote procedure calls. ACM Trans Comput Syst 2(1): 39–59 (1984)

    Google Scholar 

  2. Ciuffoletti A: Modeling stochastic diffusion in a mesh network (TR 5/92). Dipartimento di Informatica, Università di Pisa 1992

  3. Cristian F: Probabilistic clock synchronization. Distrib Comput 3: 146–158 (1989)

    Google Scholar 

  4. Cristian F, Aghili H, Strong R, Dolev D: Atomic broadcast: from simple meassage diffusion to Byzantine agreement. In: Proceedings of the International Symposium on Fault-Tolerant Computing. IEEE Comput Soc Press, Ann Arbor, 1985, pp 200–206

    Google Scholar 

  5. Demers A, Greene D, Hauser C, Irish W, Larson J, Shenker S, Sturgis H, Swinehart D, Terry D: Epidemic Algorithm for replicated database maintenance. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, August 1987. Vancouver 1987, pp 1–12

  6. Dolev D, Dwork C, Stockmeyer L: On the minimal synchronism needed for distributed consensus. J ACM 34(1): 77–97 (1987)

    Google Scholar 

  7. Fischer MJ, Lynch NA, Paterson MS: Impossibility of distributed consensus with one faulty process. J ACM 32(2): 374–382 (1985)

    Google Scholar 

  8. Kohler WH: A survey of techniques for synchronization and recovery in decentralized computer systems. Comput Surveys 13(2): 149–183 (1981)

    Google Scholar 

  9. Kopetz H, Ochsenreiter W: Clock synchronization in distributed real-time systems. IEEE Trans Comput 7(3): 404–425 (1987)

    Google Scholar 

  10. Lamport L, Melliar-Smith PM: Synchronizing clocks in the presence of faults. J ACM 32(1): 52–78 (1985)

    Google Scholar 

  11. Massey WS: Algebraic Topology: An introduction. In: Halmos PR, Gehring FW, Moore CC (eds) Graduate texts in mathematics, vol 56. Springer, Berlin Heidelberg New York 1967, pp 29–43

    Google Scholar 

  12. Melliar-Smith PM, Moser LE, Agrawala V: Broadcast protocols for distributed systems. IEEE Trans Parallel Distrib Syst 1(1): 17–25 (1990)

    Google Scholar 

  13. Schneider FB: A paradigm for reliable clock synchronization (TR 86-735). Cornell University, Ithaca, 1986, pp 86–735

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Augusto Ciuffoletti graduated in computer sciences at the University of Pisa in 1980. From 1980 to 1983 he worked with Selenia and OtoMelara on projects funded by the Italian National Research Council. Since 1984 he has been doing research at the University of Pisa, where he is now an assistant. He is particularly interested in studying efficient and reliable low level services (such as broadcast).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ciuffoletti, A. Reliability versus cost: Design of a probabilistic broadcast algorithm. Distrib Comput 7, 115–127 (1994). https://doi.org/10.1007/BF02277856

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02277856

Key words

Navigation