Learn More
Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being widely studied in the context of classical networks, few studies have been conducted in order to solve it in the context of dynamic and self-organizing systems characterized by unknown(More)
This paper presents a framework for the development of higher level communication protocols that provides extra functionalities (e.g. one-to-many ordered delivery, atomic delivery, etc.) not supplied by standard off-the-shelf lower level communication protocols (e.g. the TCP/IP suite of protocols). The framework is based on the event channel abstraction(More)
Two vertices of a graph are said to be similar if there exists a graph automorphism mapping one of them into the other. Procedures aiming to separate vertices of a graph into equivalence classes accordingly to their similarities are the basis of many isomorphism-testing algorithms. In practice, these procedures efficiently reduce the search space of(More)
Group-based computing is becoming more and more popular when one has to design a middleware able to support reliable distributed applications. This paradigm is made of two basic services, namely, a group membership service and a group communication service. More generally, a group is a set of processes cooperating to carry out a common task (e.g., copies of(More)
This paper presents an asynchronous implementation of a failure detector for unknown and mobile networks. Our approach does not rely on timers. Neither the composition nor the number of nodes in the system are known. Our algorithm can implement failure detectors of class ♦S when behavioral properties and connectivity conditions are satisfied by the(More)