Total order broadcast and multicast algorithms: Taxonomy and survey

@article{Dfago2004TotalOB,
  title={Total order broadcast and multicast algorithms: Taxonomy and survey},
  author={X. D{\'e}fago and Andr{\'e} Schiper and P{\'e}ter Urb{\'a}n},
  journal={ACM Comput. Surv.},
  year={2004},
  volume={36},
  pages={372-421}
}
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. 
Minimizing latency of agreement protocols
A Dual Digraph Approach for Leaderless Atomic Broadcast
TLDR
This paper proposes AllConcur+, an atomic broadcast algorithm that achieves minimal work by using a redundancy-free overlay network during intervals with no failures, and shows that AllConCur+'s expected performance is robust with regard to occasional failures. Expand
NFV-RBCast: Enabling the Network to Offer Reliable and Ordered Broadcast Services
Reliable Broadcast is a classic abstraction for the development of fault-tolerant distributed applications. Informally, reliable broadcast ensures that messages sent to a set of processes areExpand
Formalizing and Implementing Distributed Ledger Objects
TLDR
This paper provides a proper formulation of a distributed ledger object as a sequence of records, and provides the operations and the properties that such an object should support. Expand
MDC-Cast: A Total-Order Broadcast Protocol for Multi-Datacenter Environments
TLDR
This paper presents a novel Total-Order Broadcast protocol, called MDC-cast that specifically targets multi-datacenter environments, that is characterized by non-uniform network connectivity among a set of remote datacenters. Expand
Observable atomic consistency for CvRDTs
TLDR
This paper provides a distributed implementation of OACP, the observable atomic consistency protocol, based on Akka, a widely-used actor-based middleware, and shows that OACP can reduce coordination overhead compared to other protocols providing atomic consistency. Expand
Utilizando NFV para Implementar a Difusão Confiável e Ordenada de Mensagens na Rede
Este trabalho apresenta um backbone virtual baseado em NFV (Network Function Virtualization) que oferece servicos de difusao de mensagens implementados na propria rede. Os servicos de difusao saoExpand
Rapport scientifique présenté pour l ’ obtention d ’ une Habilitation à Diriger des Recherches
State machine replication (SMR) is a software technique for tolerating failures using commodity hardware. The critical service to be made fault-tolerant is modeled by a state machine. Several,Expand
Language Expressiveness and Quality of Service for Content-based Publish/Subscribe Systems
TLDR
This thesis is to develop integrated solutions to extend pub/sub language expressiveness and quality of service, as well as demonstrate that this approach results in better performance from a holistic perspective. Expand
Scalable coordination of distributed in-memory transactions
TLDR
It is experimentally demonstrated that transaction latency and throughput scale considerably well when an atomic multicast service is offered to transaction nodes by a crash-tolerant ensemble of dedicated nodes and that using such a service is the most scalable approach compared to practices advocated in the literature. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 218 REFERENCES
Distributing trust with the Rampart toolkit
TLDR
Research is described on distributing trust among a group of nodes, so while no single node need be fully trusted, the function performed by the group can be, and a toolkit of group communication protocols called Rampart is developed to simplify construction of such groups. Expand
Totem: a fault-tolerant multicast group communication system
When Totem delivers multicast messages, it invokes operations in the same total order throughout the distributed system. The result: consistency of replicated data and simpli ed programming ofExpand
Secure agreement protocols: reliable and atomic group multicast in rampart
TLDR
Rampart is the first system to demonstrate reliable and atomic group multicast in asynchronous systems subject to process corruptions, and is described as part of Rampart, a toolkit for building high-integrity distributed services. Expand
AMp: A Highly Parallel Atomic Multicast Protocol
TLDR
An atomic multicast protocol for token passing Lans is presented, built on standard Lans, in view of taking advantage of the availability of communications hardware and the possibility of coexistence with standard stations, in the same network. Expand
Using time instead of time-outs in fault-tolerant systems
  • ACM Trans. Program. Lang. Syst. 6, 2, 256–280.
  • 1984
Quiescent Reliable Communication and Quiescent Consensus in Partitionable Networks
TLDR
This work generalizes the specification of the heartbeat failure detector HB, shows how to implement it, and show how to use it to achieve quiescent reliable communication. Expand
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
TLDR
Description d'une methode generale pour implementer un systeme reparti ayant n'importe quel degre desire de tolerance de panne, d'un solution au probleme «Bizantine Generals» sont assumes. Expand
Formal specification and compositional verification of an atomic broadcast protocol
TLDR
It is shown that the verification of the protocol can be done compositionally by using specifications in which timing is expressed by local clock values, and it is verified that parallel execution of the server processes leads to the desired properties. Expand
On interprocess communication
  • L. Lamport
  • Computer Science, Engineering
  • Distributed Computing
  • 2005
TLDR
In Part II, the formalism is used to specify several classes of interprocess communication mechanisms and to prove the correctness of algorithms for implementing them. Expand
...
1
2
3
4
5
...