An Adaptive Failure Detection Protocol

  • Authors:
  • Christol Fetzer;Michel Raynal;Frederic Tronel

  • Affiliations:
  • -;-;-

  • Venue:
  • PRDC '01 Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The detection of process failures is a crucial problem system designers have to cope with in order to buildfault-tolerant distributed platforms.Unfortunately, it is impossibleto distinguish with certainty a crashed process froma very slow process in a purely asynchronous distributedsystem.This prevents some problems to be solved in suchsystems.That is why failure detector oracles have been introduced to circumvent these impossibility results.This paper presents a relatively simple protocol that allowsa process to "monitor" another process, and consequentlyto detect its crash.This protocol enjoys the nice propertyto rely as much as possible on application messagesto do this monitoring.Differently from previous processcrash detection protocols, it uses control messages onlywhen no application messages is sent by the monitoring process to the observed process.This protocol has noteworthyfeatures.When the underlying system satisfies the partialsynchrony assumption, it actually implements an eventuallyperfect failure detector (i.e., a failure detector of the classusually denoted 3 P).Moreover, if the average observedtransmission delay is finite and the upper layer applicationterminates within a bounded number of steps for any failuredetector in 3 P after the failure detector becomes "perfect",then, when run with the proposed protocol, it alsoterminates correctly.These properties make the protocolattractive:it is inexpensive, implementable, and powerful.The paper also describes performance measurements of animplementation of the protocol.