Asynchronous fault-tolerant total ordering algorithms
SIAM Journal on Computing
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
TOTEM: a reliable ordered delivery protocol for interconnected local-area networks
TOTEM: a reliable ordered delivery protocol for interconnected local-area networks
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Reliable Distributed Computing with the ISIS Toolkit
Reliable Distributed Computing with the ISIS Toolkit
RMP: Fault-Tolerant Group Communication
IEEE Micro
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A High Performance Totally Ordered Multicast Protocol
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
Totally ordered multicast in large-scale systems
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Analyzing the latency of the Totem multicast protocols
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
A reliable ordered delivery protocol for interconnected local area networks
ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
Newtop: a fault-tolerant group communication protocol
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
The SecureRing group communication system
ACM Transactions on Information and System Security (TISSEC)
Moshe: A group membership service for WANs
ACM Transactions on Computer Systems (TOCS)
Evaluating the running time of a communication round over the internet
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Overview of the InterGroup Protocols
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Ruminations on Domain-Based Reliable Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Dealing efficiently with data-center disasters
Journal of Parallel and Distributed Computing
Admission control in Peer-to-Peer: design and performance evaluation
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
An analysis of update ordering in distributed replication systems
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
Implementing a replicated service with group communication
Journal of Systems Architecture: the EUROMICRO Journal
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
The mobile groups approach for the coordination of mobile agents
Journal of Parallel and Distributed Computing
A cost-benefit flow control for reliable multicast and unicast in overlay networks
IEEE/ACM Transactions on Networking (TON)
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
Message-ordered multicast by common building blocks
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Challenges in evaluating distributed algorithms
Future directions in distributed computing
TCP-ABC: from multiple TCP connections to atomic broadcasting
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
LibRe: a consistency protocol for modern storage systems
Proceedings of the 6th ACM India Computing Convention
| Hi-index | 0.00 |
The Totem multiple-ring protocol provides reliable totally ordereddelivery of messages across multiple local-area networks interconnectedby gateways. This consistent message order is maintained in the presenceof network partitioning and remerging, and of processor failure andrecovery. The protocol provides accurate topology change information aspart of the global total order of messages. It addresses the issue ofscalability and achieves a latency that increases logarithmically withsystem size by exploiting process group locality and selectiveforwarding of messages through the gateways. Pseudocode for the protocoland an evaluation of its performance are given.—Authors' Abstract