IEEE Transactions on Software Engineering
IEEE Transactions on Knowledge and Data Engineering
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Solving Atomic Multicast When Groups Crash
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Implementation and performance testing of a gossip-based communication system
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
On the inherent cost of atomic broadcast and multicast in wide area networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
| Hi-index | 0.00 |
We present a new scalable fault-tolerant algorithm which ensures total order delivery of messages sent to multiple groups of processes. Our algorithm is particularly well suited for large scale systems because: (1) any process can multicast a message to one or more groups of processes without being forced to join those groups; (2) inter-group total order is ensured system-wide but, for each individual multicast, the number and size of messages exchanged depends only on the number of addressees; (3) process failure detection does not need to be reliable.Our algorithm also exhibits a modular design. It uses two companion protocols, namely a reliable multicast protocol and a consensus protocol, and these protocols are not required to use the same communication channels or to share common variables with the total order protocol. This approach follows a design methodology based on the composition of (encapsulated) micro-protocols.