DocumentCode
652888
Title
Optimistic Atomic Multicast
Author
Bezerra, Carlos Eduardo ; Pedone, Fernando ; Garbinato, B. ; Geyer, Christopher
fYear
2013
fDate
8-11 July 2013
Firstpage
380
Lastpage
389
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
multicast protocols; telecommunication network reliability; atomic order; local-area network; message delays; optimistic atomic multicast; optimistic group communication protocols; ordering guarantees; ordering protocols; reduced latency; reliable distributed systems; spontaneous message ordering; wide-area network; Clocks; Delays; Multicast communication; Multicast protocols; Reliability; Throughput; atomic multicast; fifo reliable multicast; optimistic delivery; quasi-genuine;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems (ICDCS), 2013 IEEE 33rd International Conference on
Conference_Location
Philadelphia, PA
ISSN
1063-6927
Type
conf
DOI
10.1109/ICDCS.2013.46
Filename
6681607
Link To Document