Eventually Strong Failure Detector with Unknown Membership

Abstract : The distributed computing scenario is rapidly evolving for integrating self-organizing and dynamic wireless networks. Unreliable failure detectors (FDs) are classical mechanisms that provide information about process failures and can help systems to cope with the high dynamics of these networks. A number of failure detection algorithms have 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 time-based, requiring that eventually some bound on the message transmission will permanently hold. These assumptions are no longer appropriate to the new scenario. This paper presents a new FD protocol that 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 of being time-free, so that it does not rely on timers to detect failures; moreover, it tolerates the mobility of nodes and message losses.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01197412
Contributor : Lip6 Publications <>
Submitted on : Friday, September 11, 2015 - 4:13:32 PM
Last modification on : Thursday, March 21, 2019 - 1:12:07 PM

Identifiers

Citation

Fabíola Greve, Pierre Sens, Luciana Arantes, Véronique Simon. Eventually Strong Failure Detector with Unknown Membership. The Computer Journal, Oxford University Press (UK), 2012, 55 (12), pp.1507-1524. 〈10.1093/comjnl/bxs084〉. 〈hal-01197412〉

Share

Metrics

Record views

221