Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
On scalable and efficient distributed failure detectors
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Reliable MAC Layer Multicast in IEEE 802.11 Wireless Networks
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
A Gossip-Style Failure Detection Service
A Gossip-Style Failure Detection Service
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Cluster-Based Failure Detection Service for Large-Scale Ad Hoc Wireless Network Applications
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
From Static Distributed Systems to Dynamic Systems
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership
IEEE Transactions on Parallel and Distributed Systems
Implementing unreliable failure detectors with unknown membership
Information Processing Letters
Decentralized Local Failure Detection in Dynamic Distributed Systems
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
The Eventual Leadership in Dynamic Mobile Networking Environments
PRDC '07 Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing
Reliable Broadcast in Radio Networks with Locally Bounded Failures
IEEE Transactions on Parallel and Distributed Systems
Eventual Leader Election in Infinite Arrival Message-Passing System Model with Bounded Concurrency
EDCC '10 Proceedings of the 2010 European Dependable Computing Conference
A failure detector for wireless networks with unknown membership
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Characterizing topological assumptions of distributed algorithms in dynamic networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
Failure detectors are classical mechanisms which provide information about process failures and can help systems to cope with the high dynamics of self-organizing, unstructured and mobile wireless networks. Unreliable failure detectors of class ◊S are of special interest because they meet the weakest assumptions able to solve fundamental problems on the design of dependable systems. Unfortunately, a negative result states that no failure detector of that class can be implemented in a network of an unknown membership; but full membership knowledge as well as fully communication connectivity are no longer appropriate assumptions to the new scenario of dynamic networks. In this paper, we provide a discussion about the conditions and model able to implement failure detectors in dynamic networks and define a new class, namely ◊SM, which adapts the properties of the ◊S class to a dynamic network with an unknown membership.