Total order broadcast and multicast algorithms

Xavier Défago, André Schiper, Péter Urbán
2004 ACM Computing Surveys  
Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance. In short, the primitive ensures that messages sent to a set of processes are, in turn, delivered by all those processes in the same total order. The problem has inspired an abundance of literature, with a plethora of proposed algorithms. This article proposes a classification of total order broadcast and multicast
more » ... multicast algorithms based on their ordering mechanisms, and addresses a number of other important issues. The article surveys about sixty algorithms, thus providing by far the most extensive study of the problem so far. The article discusses algorithms for both the synchronous and the asynchronous system models, and studies the respective properties and behavior of the different algorithms. raises some fundamental questions that inspired a part of our work. It is, however, a little outdated now. In addition, the authors only study seven different algorithms, which are not truly representative; for instance, none is based on a communication history approach (one of the five classes of algorithms; details in Section 4.4).
doi:10.1145/1041680.1041682 fatcat:hl2evvvb2zfrlhzzcrnyctdcfe