Optimistic Atomic Multicast

Message ordering is one of the cornerstones of reliable distributed systems. However, some ordering guarantees, such as atomic order, are expensive to implement in terms of message delays. This paper presents Optimistic Atomic Multicast, a protocol that combines reduced latency and increased throughput. Messages can be delivered optimistically in a single communication step and conservatively in three communication steps. Differently from previous optimistic group communication protocols, Optimistic Atomic Multicast does not rely on spontaneous message ordering for fast delivery. In addition to presenting Optimistic Atomic Multicast, we provide detailed performance results comparing it to other ordering protocols in both local-area and wide-area networks.

[1]  Leslie Lamport.  Lower bounds for asynchronous consensus , 2003 .

[2]  Francisco Moura,et al.  Optimistic total order in wide area networks , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[3]  André Schiper,et al.  Scalable atomic multicast , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[4]  Flaviu Cristian,et al.  Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement , 1995, Inf. Comput..

[5]  Sam Toueg,et al.  Fault-tolerant broadcasts and related problems , 1993 .

[6]  Jorge L. V. Barbosa,et al.  A peer-to-peer simulation technique for instanced massively multiplayer games , 2006, 2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[7]  R. Guerraoui,et al.  Genuine Atomic Multicast in Asynchronous Systems , 1998 .

[8]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

[9]  Fred B. Schneider.  What good are models and what models are good , 1993 .

[10]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[11]  Marcos K. Aguilera,et al.  Efficient atomic broadcast using deterministic merge , 2000, PODC '00.

[12]  Carlo Curino,et al.  Schism , 2010, Proc. VLDB Endow..

[13]  Gustavo Alonso,et al.  Using Optimistic Atomic Broadcast in Transaction Processing Systems , 2003, IEEE Trans. Knowl. Data Eng..

[14]  Achour Mostéfaoui,et al.  Fault-tolerant Total Order Multicast to asynchronous groups , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[15]  André Schiper,et al.  Optimistic atomic broadcast: a pragmatic viewpoint , 2003, Theor. Comput. Sci..

[16]  André Schiper,et al.  Generic Broadcast , 1999, DISC.

[17]  Leslie Lamport,et al.  Fast Paxos , 2006, Distributed Computing.

[18]  Fernando Pedone,et al.  On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks , 2008, ICDCN.

[19]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[20]  Leslie Lamport,et al.  Generalized Consensus and Paxos , 2005 .

[21]  Marc Shapiro,et al.  Fast Genuine Generalized Consensus , 2011, 2011 IEEE 30th International Symposium on Reliable Distributed Systems.