Reliable and total order broadcast in the crash-recovery model

Authors:
Romain Boichat;Rachid Guerraoui
Affiliations:
School of Computer Communication Sciences, Swiss Federal Institute of Technology, EPFL, CH-1015 Lausanne, Switzerland;School of Computer Communication Sciences, Swiss Federal Institute of Technology, EPFL, CH-1015 Lausanne, Switzerland
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 11
Cited 4

Reliable communication in the presence of failures

ACM Transactions on Computer Systems (TOCS)
The Totem single-ring ordering and membership protocol

ACM Transactions on Computer Systems (TOCS)
A reliable dissemination protocol for interactive collaborative applications

Proceedings of the third ACM international conference on Multimedia
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
Reliable broadcast protocols

ACM Transactions on Computer Systems (TOCS)
Lightweight Probabilistic Broadcast

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Newtop: a fault-tolerant group communication protocol

ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
TRAM: A Tree-based Reliable Multicast Protocol

TRAM: A Tree-based Reliable Multicast Protocol
Failure detection and consensus in the crash-recovery model

Distributed Computing

The collective memory of amnesic processes

ACM Transactions on Algorithms (TALG)
Online recovery in cluster databases

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Optimistic Erasure-Coded Distributed Storage

DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On detecting termination in the crash-recovery model

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problems of broadcasting messages in a reliable and totally ordered manner assuming a crash-recovery model, i.e., a model where processes and channels may crash and possibly recover. We present a suite of specifications of reliable and total order broadcast abstractions for this model and we describe algorithms that implement those specifications. The properties of broadcast abstractions are first given separately and then composed: this provides a comprehensive design space for broadcast semantics. The algorithms we give are efficient both in terms of time-complexity (communication steps) and log-complexity (disk accesses).