Optimistic Atomic Multicast

Details

Serval ID
serval:BIB_278BF1C8F9C4
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
Optimistic Atomic Multicast
Title of the conference
2013 IEEE 33rd International Conference on Distributed Computing Systems
Author(s)
Bezerra C.E., Pedone F., Garbinato B., Geyer C.
Publisher
IEEE
Address
Philadelphia, PA, USA
ISBN
978-0-7695-5000-8
Publication state
Published
Issued date
07/2013
Peer-reviewed
Oui
Series
IEEE International Conference on Distributed Computing Systems
Pages
380-389
Language
english
Abstract
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.
Keywords
Fifo reliable multicast, Atomic multicast, Quasi-genuine, Optimistic delivery
Web of science
Create date
14/07/2017 11:44
Last modification date
21/08/2019 6:15
Usage data