Learn More
In self-organizing systems, such as mobile ad-hoc and peer-to-peer networks, consensus is a fundamental building block to solve agreement problems. It contributes to coordinate actions of nodes distributed in an ad-hoc manner in order to take consistent decisions. It is well known that in classical environments, in which entities behave asynchronously and(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)
Consensus services have been recognized as fundamental building blocks for fault-tolerant distributed systems. Many different protocols to implement such a service have been proposed, however, not a lot of effort has been placed in evaluating their performance. In particular, in the context of round-based consensus protocols for asynchronous systems(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)
We consider the priority inversion problem in an actively replicated system. Priority inversion was originally defined in the context of non-replicated systems. Therefore we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively(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)