• DocumentCode
    1971218
  • Title

    Solving Atomic Broadcast with Indirect Consensus

  • Author

    Ekwall, Richard ; Schiper, André

  • Author_Institution
    Ecole Polytech. Fed. de Lausanne
  • fYear
    2006
  • fDate
    25-28 June 2006
  • Firstpage
    156
  • Lastpage
    165
  • Abstract
    In previous work, it has been shown how to solve atomic broadcast by reduction to consensus on messages. While this solution is theoretically correct, it has its limitations in practice, since executing consensus on large messages can quickly saturate the system. The problem can be addressed by executing consensus on message identifiers instead of the full messages, in order to decouple the size of the messages from the size of the data sent by the consensus algorithm. In this paper, we study the impact of executing consensus on message identifiers instead of on the full messages, in the context of solving atomic broadcast. We also discuss the implications of executing consensus on message identifiers on the consensus and atomic broadcast algorithms
  • Keywords
    fault tolerant computing; message passing; atomic broadcast algorithms; consensus algorithm; message identifiers; Broadcasting; Computer crashes; Detectors; Distributed computing; Fault diagnosis; Fault tolerance; Formal specifications; Resilience;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Dependable Systems and Networks, 2006. DSN 2006. International Conference on
  • Conference_Location
    Philadelphia, PA
  • Print_ISBN
    0-7695-2607-1
  • Type

    conf

  • DOI
    10.1109/DSN.2006.65
  • Filename
    1633505