This paper presents a solution to the (processor) group

Existing group membership mechanisms provide consistent views of membership changes. However, they require heavyweight synchronous multicast protocols. We present a new lightweight group membership mechanism that allows temporary inconsistencies in membership views. This mechanism uses epidemic communication techniques to ensure that all group members eventually converge to a consistent view of...

This paper considers a permutation group G = 〈S〉 of degree n with t orbits such that the action on each orbit is primitive. It presents a O(tn2 logc(n)) time Monte Carlo group membership algorithm for some constant c. The algorithm is notable for its use of a new theorem showing how to find O(t log n) generators in O (̃|S|n) time under a more general form of the above hypotheses. The algorithm r...

Group communication is a useful abstraction in the development of highly available distributed and communication-oriented applications in wide area networks (WANs). The most important aspects of this abstraction are the dynamic maintenance of group membership and its diverse semantics for interleaving membership change notiications within the ow of regular messages. In this paper we propose a n...

Group communication system (GCS) is a useful mechanism for constructing reliable, fault-tolerant distributed application. When GCS is extended in mobile environment, the membership change occurs frequently due to the mobility of mobile nodes and unreliable wireless communication within a cell. In this paper, we propose a scalable group communication scheme to support mobile systems in an Intern...

This paper studies the problem of maintaining eventual consistent group membership without any synchrony assumption inside an unbounded group G of processes that varies over the time (processes may join and leave the group). Eventual consistency means that if at any time all group membership changes cease, processes will converge in a finite time to a single consistent view. Due to the lack of ...

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 members...

This paper presents Group Membership Service for JXTA extended with single or bi-directional authentication. The proposed solution exploits certificates and PKI (Public Key Infrastructure). All information about the system's users is kept in the LDAP. An attention has been also paid to the problem of a private key secure protection.

We study fault tolerance properties of the group membership problem (GMP) in asynchronous systems. This problem requires each process to determine the processes with which it can communicate. We compare the properties of the GMP and consensus. We define failure sensitivity as the necessary property of a failure detector to enable a solution to the GMP. We demonstrate that the known consensus fa...

A group membership protocol is presented and proven correct for a synchronous time-triggered model of computation with processors in a ring that broadcast in turn. The protocol, derived from one used for critical control functions in automobiles, accepts a very restrictive fault model to achieve low overhead and requires only one bit of membership information piggybacked on regular broadcasts. ...