A membership service is used in a distributed system to maintain information about which sites are functioning and which have failed at any given time. Such services have proven to be fundamental for constructing distributed applications, with many example services and algorithms defined in the literature. Despite these efforts, however, little has been done on examining the abstract properties commonly guaranteed by membership services independent of a given implementation. Here, a number of these properties are identified and defined. These properties range from agreement among sites on membership changes, consistent ordering of change notifications, and timing properties to various ways for dealing with recoveries and partitions. Message...
We introduce a membership protocol that maintains the set of currently connected machines in an asyn...
Failure detection and group membership are two important components of fault-tolerant distributed sy...
We describe a novel scalable group membership algorithm designed for wide area networks (WANs). Our ...
The problem of group membership has been the focus of much theoretical and experimental work on fa...
Distributed applications need membership services to know which of their components are active or ha...
Many distributed systems for widearea networks can be built conveniently, and operate efficiently a...
Fault tolerance--that is, the ability of a system to continue providing its specified service despit...
Abstract. A particular case of open group is that of a large-scale system where an unbounded and dyn...
Fault tolerance---that is, the ability of a system to continue providing its specified service despi...
Research, into the problem of membership agreement, has been going on for approximately the last 30 ...
In a distributed fault-tolerant server system realized according to the open group model, inconsiste...
Many fault-tolerant systems organize the replicas of an application process as a process group. The ...
We present Census, a platform for building large-scale distributed applications. Census provides a m...
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm t...
Abstract—In ubiquitous computing, as more and more devices are introduced into the environment, new ...
We introduce a membership protocol that maintains the set of currently connected machines in an asyn...
Failure detection and group membership are two important components of fault-tolerant distributed sy...
We describe a novel scalable group membership algorithm designed for wide area networks (WANs). Our ...
The problem of group membership has been the focus of much theoretical and experimental work on fa...
Distributed applications need membership services to know which of their components are active or ha...
Many distributed systems for widearea networks can be built conveniently, and operate efficiently a...
Fault tolerance--that is, the ability of a system to continue providing its specified service despit...
Abstract. A particular case of open group is that of a large-scale system where an unbounded and dyn...
Fault tolerance---that is, the ability of a system to continue providing its specified service despi...
Research, into the problem of membership agreement, has been going on for approximately the last 30 ...
In a distributed fault-tolerant server system realized according to the open group model, inconsiste...
Many fault-tolerant systems organize the replicas of an application process as a process group. The ...
We present Census, a platform for building large-scale distributed applications. Census provides a m...
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm t...
Abstract—In ubiquitous computing, as more and more devices are introduced into the environment, new ...
We introduce a membership protocol that maintains the set of currently connected machines in an asyn...
Failure detection and group membership are two important components of fault-tolerant distributed sy...
We describe a novel scalable group membership algorithm designed for wide area networks (WANs). Our ...