Abstract
A novel and efficient group communication (multicast) protocol, based on a single logical-clock token ring approach, is described. The protocol is highly efficient and it guarantees total ordering and atomicity of multicast messages for asynchronous distributed systems. Unlike other logical token-ring algorithms, the protocol does not have a problem of token loss. The optimized fault-tolerant algorithms of the protocol can handle process failures and network partitioning. The experiment results of the implemented protocol in a local area network of workstations have demonstrated that its performance is better than any existing solutions in the same environment, especially, for achieving message total ordering and atomic (safe) delivery.
Original language | English |
---|---|
Title of host publication | Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS |
Publisher | IEEE |
Pages | 378-385 |
Number of pages | 8 |
Publication status | Published - 1 Jan 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) - Tokyo, Japan Duration: 3 Jun 1996 → 6 Jun 1996 |
Conference
Conference | Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) |
---|---|
Country/Territory | Japan |
City | Tokyo |
Period | 3/06/96 → 6/06/96 |
ASJC Scopus subject areas
- Hardware and Architecture