Communicating sequential processes
Communicating sequential processes
Design and validation of computer protocols
Design and validation of computer protocols
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
TOTEM: a reliable ordered delivery protocol for interconnected local-area networks
TOTEM: a reliable ordered delivery protocol for interconnected local-area networks
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
The Transis approach to high availability cluster communication
Communications of the ACM
Horus: a flexible group communication system
Communications of the ACM
Building secure and reliable network applications
Building secure and reliable network applications
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
The Architecture and Performance of Security Protocols in the Ensemble Group Communication System
The Architecture and Performance of Security Protocols in the Ensemble Group Communication System
The intergroup protocols: scalable group communication for the internet
The intergroup protocols: scalable group communication for the internet
The Agreement Problem Protocol Verification Environment
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
| Hi-index | 0.00 |
In this paper we present a novel approach to fault-tolerant group membership for use predominantly in collaborative computing environments. As an exemplar, we use the Collaborative Computing Transport Layer which offers reliable atomic multicast capabilities for use in collaborative environments such as the Collaborative Computing Frameworks (CCF). Specific design goals of the approach are the elimination of processing overhead due to heartbeats, support for partial failures and extensibility. These goals are satisfied in an approach, termed Collaborative Group Membership (CGM), which uses a quiescent weak failure detector and two election based algorithms to form consensus on the membership of a failing group. Failure detection operates through a reliable multicast primitive and as such eliminates the need for explicit keep-alive packets; thus in a failure free environment, CGM imposes no overhead.