Abstract
This paper presents an efficient and novel reliable group multicast protocol for asynchronous distributed systems. Based on a logical-clock loken ring approach, the protocol guarantees the total ordering and atomicity of multicast messages and is highly efficient. The recovery algorithms of the protocol can handle communication faults, process crash failures and network partition. We describe the detailed design, a correctness proof and the performance analysis of the protocol. For a group of n processes, the protocol requires only up to (n - 1) control messages to reach a consistent view of the group in a fault-free case. The protocol has been implemented on a local area network of workstations. The performance of the implementation is also presented.
| Original language | English |
|---|---|
| Pages (from-to) | 37-53 |
| Number of pages | 17 |
| Journal | Computer Communications |
| Volume | 21 |
| Issue number | 1 |
| Publication status | Published - 1 Feb 1998 |
| Externally published | Yes |
Keywords
- Atomic multicast
- Communication protocols
- Distributed systems fault tolerance
- Token ring
ASJC Scopus subject areas
- Computer Networks and Communications