Skip to Main content Skip to Navigation
Reports

Asynchronous Implementation of Failure Detectors with partial connectivity and unknown participants

Abstract : The distributed computing scenario is rapidly evolving for integrating selforganizing 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 permanently 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 <>S(M), 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.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/inria-00122517
Contributor : Pierre Sens <>
Submitted on : Wednesday, March 30, 2011 - 8:29:44 AM
Last modification on : Friday, January 8, 2021 - 5:46:03 PM

File

RR-6088.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00122517, version 4

Citation

Fabiola Greve, Pierre Sens, Luciana Arantes, Véronique Martin. Asynchronous Implementation of Failure Detectors with partial connectivity and unknown participants. [Research Report] RR-6088, INRIA. 2011, pp.29. ⟨inria-00122517v4⟩

Share

Metrics

Record views

390

Files downloads

390