Stability of distributed algorithms in the face of incessant faults

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two well-known self-stabilizing algorithms under these fault models. For a small number of processes, the properties of interest are verified automatically using probabilistic model-checking tools. For a large number of processes, these properties are characterized using asymptotic bounds from a direct Markov chain analysis and approximated by numerical simulations.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 11th International Symposium, SSS 2009, Proceedings
Pages224-237
Number of pages14
DOIs
StatePublished - 2009
Event11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009 - Lyon, France
Duration: Nov 3 2009Nov 6 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5873 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009
Country/TerritoryFrance
CityLyon
Period11/3/0911/6/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Stability of distributed algorithms in the face of incessant faults'. Together they form a unique fingerprint.

Cite this