Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
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 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
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Design and Performance Evaluation of Efficient Consensus Protocols for Mobile Ad Hoc Networks
IEEE Transactions on Computers
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
Multihop Ad Hoc Networking: The Theory
IEEE Communications Magazine
What model and what conditions to implement unreliable failure detectors in dynamic networks?
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
The distributed computing scenario is rapidly evolving for integrating self-organizing and dynamic wireless networks. Unreliable failure detectors are classical mechanisms which provide information about process failures and can help systems to cope with the high dynamism of these networks. A number of failure detection algorithms has been proposed so far; nonetheless, most of them assume a global knowledge about the membership as well as a fully communication connectivity; additionally, they are timer-based, requiring that eventually some bound on the message transmission will hold. These assumptions are no longer appropriate to the new scenario. This paper presents a new failure detector protocol which implements a new class of detectors, namely ⋄SM, which adapts the properties of the ⋄S class to a dynamic network with an unknown membership. It has the interesting feature to be time-free, so that it does not rely on timers to detect failures; moreover, it tolerates mobility of nodes and message losses.