The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
On the impossibility of group membership
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Client-Access Protocols for Replicated Services
IEEE Transactions on Software Engineering
Group Communication in Partitionable Systems: Specification and Algorithms
IEEE Transactions on Software Engineering
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
On group communication in large-scale distributed systems
EW 6 Proceedings of the 6th workshop on ACM SIGOPS European workshop: Matching operating systems to application needs
A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Increasing availability in a replicated partitionable distributed object system
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
A particular case of open group is that of a large–scale system where an unbounded and dynamically changing set of client nodes continuously connect and disconnect from a reduced and stable group of servers. We propose an extended specification of the membership problem, that takes into account the different consistency properties that both types of nodes require from the membership information in such a scenario. The specification is completely independent of any group communication layer, assuming only the presence of a local failure detector at each node. We also describe a membership service that satisfies the specification and sketch a proof for its properties.