Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
A multicast transport protocol
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Preserving and using context information in interprocess communication
ACM Transactions on Computer Systems (TOCS)
Time and message efficient reliable broadcasts
Proceedings of the 4th international workshop on Distributed algorithms
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Journal of Supercomputing
| Hi-index | 0.01 |
In this paper we present a solution to the causal reliable multicast problem. User processes generate separate sequences of messages and specify the causal relation among them according to some application need; the algorithm ensures that the messages within the same sequence are delivered to all active, i.e. both correct and faulty, processes in the group, or to none of them, and are processed according to their causal order. Messages belonging to different sequences can be concurrently processed.This problem has few solutions presented in literature; in common with a part of them, the algorithm we describe has the centralized approach and the use of history buffers to recover from omission failures. The differences mainly concern the mechanism we devised to recover from crash failures, that avoids resorting to specialized protocols. As a consequence, under failure conditions, the algorithm performs better than other proposals in terms of both network load and throughput without affecting the performances under reliable conditions. Further, it allows to implement the most general interpretation of causality and it does not require any particular service to the underlying transport protocol.