A Hierarchy of Totally Ordered Multicasts

The increased interest in protocols that provide a total order on message delivery has led to several different definitions of total order. In this paper we investigate these different definitions and propose a hierarchy that helps to better understand the implications of the different possibilities in terms of guarantees and communication cost. We identify two definitions: {\em weak total order} and {\em strong total order}, which are at the extremes of the proposed hierarchy, and incorporate them into a consistent design. Finally, we propose high-level algorithms based on a virtually synchronous communication environment that implement the given definitions.


Published in:
Proceedings of the 14th IEEE Symposium on Reliable Distributed Systems (SRDS-14)
Year:
1995
Laboratories:




 Record created 2005-05-20, last modified 2018-03-17

n/a:
Download fulltext
PS

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)