An adaptive totally ordered multicast protocol that tolerates partitions
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The Totem multiple-ring ordering and topology maintenance protocol
ACM Transactions on Computer Systems (TOCS)
Policies for using replica groups and their effectiveness over the Internet
COMM '00 Proceedings of NGC 2000 on Networked group communication
Consensus-based fault-tolerant total order multicast
IEEE Transactions on Parallel and Distributed Systems
Membership-Insensitive Totally Ordered Multicast: Properties and Performance
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Topology-Aware Algorithms for Large-Scale Communication
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Dealing efficiently with data-center disasters
Journal of Parallel and Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Groups Partitioning Over CORBA for Cooperative Work
Cluster Computing
Throughput optimal total order broadcast for cluster environments
ACM Transactions on Computer Systems (TOCS)
Run-time switching between total order algorithms
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Practical database replication
Replication
| Hi-index | 0.00 |
Totally ordered multicast protocols have proved to be extremely useful in supporting fault-tolerant distributed applications. This paper compares the performance of the two main classes of protocols providing total order in large-scale systems (token-site and symmetric protocols) and proposes a new dynamic hybrid protocol that, when applied to systems where the topology/traffic patterns are not known a priori, offers a much lower latency than any of the previous classes of protocols in isolation.