Skip to main content
Springer Nature Link
Log in

Optimistic Generic Broadcast

  • Conference paper
Distributed Computing (DISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3724))

Included in the following conference series:

  • 662 Accesses

Abstract

We consider an asynchronous system with the Ω failure detector, and investigate the number of communication steps required by various broadcast protocols in runs in which the leader does not change. Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all correct processes receive messages in the same order. Generic Broadcast requires two steps if no messages conflict. We present an algorithm that subsumes both of these approaches and guarantees two-step delivery if all conflicting messages are received in the same order, and three-step delivery otherwise. Internally, our protocol uses two new algorithms. First, a Consensus algorithm which decides in one communication step if all proposals are the same, and needs two steps otherwise. Second, a method that allows us to run infinitely many instances of a distributed algorithm, provided that only finitely many of them are different. We assume that fewer than a third of all processes are faulty (n > 3f).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Thrifty Generic Broadcast. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 268–282. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Brasileiro, F., Greve, F., Mostefaoui, A., Raynal, M.: Consensus in one communication step. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol. 2127, pp. 42–50. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Charron-Bost, B., Schiper, A.: Uniform Consensus is harder than Consensus. Technical Report DSC/2000/028, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland (May 2000)

    Google Scholar 

  5. Défago, X., Schiper, A., Urbán, P.: Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Computing Surveys 36(4), 372–421 (2004)

    Article  Google Scholar 

  6. Guerraoui, R., Raynal, M.: The information structure of indulgent Consensus. Technical Report PI-1531, IRISA (April 2003)

    Google Scholar 

  7. Hadzilacos, V., Toueg, S.: Fault-tolerant broadcast and related problems. In: Mullender, S. (ed.) Distributed Systems, ch. 5, 2nd edn., pp. 97–146. ACM Press, New York (1993)

    Google Scholar 

  8. Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR94-1425 (1994)

    Google Scholar 

  9. Hurfin, M., Raynal, M.: A simple and fast asynchronous consensus protocol based on a weak failure detector. Distributed Computing 12(4), 209–223 (1999)

    Article  Google Scholar 

  10. Keidar, I., Rajsbaum, S.: On the cost of fault-tolerant Consensus when there are no faults. ACM SIGACT News 32 (2001)

    Google Scholar 

  11. Lamport, L.: Paxos made simple. ACM SIGACT News 32(4), 18–25 (2001)

    Google Scholar 

  12. Lamport, L.: Lower bounds on Consensus (March 2002) (unpublished note)

    Google Scholar 

  13. Pedone, F., Schiper, A.: Handling message semantics with Generic Broadcast protocols. Distributed Computing 15(2), 97–107 (2002)

    Article  Google Scholar 

  14. Pedone, F., Schiper, A.: Optimistic Atomic Broadcast: a pragmatic viewpoint. Theoretical Computer Science 291(1), 79–101 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pedone, F., Schiper, A.: On the inherent cost of Generic Broadcast. Technical Report IC/2004/46, Swiss Federal Institute of Technology (EPFL) (May 2004)

    Google Scholar 

  16. Pedone, F., Schiper, A.: Generic Broadcast. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 94–106. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Schiper, A.: Early Consensus in an asynchronous system with a weak failure detector. Distributed Computing 10(3), 149–157 (1997)

    Article  Google Scholar 

  18. Zieliński, P.: Optimistic Generic Broadcast. Technical Report 638, Computer Laboratory, University of Cambridge (July 2005), http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-638.html

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, University of Cambridge,  

    Piotr Zieliński

Authors
  1. Piotr Zieliński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zieliński, P. (2005). Optimistic Generic Broadcast. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_27

Download citation

  • DOI: https://doi.org/10.1007/11561927_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics