Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
The process group approach to reliable distributed computing
Communications of the ACM
A dynamic view-oriented group communication service
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Group Communication in Partitionable Systems: Specification and Algorithms
IEEE Transactions on Software Engineering
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
The Timewheel Group Communication System
IEEE Transactions on Computers
| Hi-index | 0.00 |
The notion of Group communication has long been introduced as a core service of distributed systems. More recently, this notion appeared with a somewhat different meaning in the field of mobile ad hoc systems. In this context, we study the group membership problem. After specifying the basic safety properties of such groups and a maximality criterion based on cliques, we propose a group membership algorithm. Lastly, with respect to this criterion, we compare our algorithm with two group membership algorithms for ad hoc environments. Moreover, a formal description in TLA+ has been programmed and verified by model-checking for small networks.