TY - GEN
T1 - Stability of distributed algorithms in the face of incessant faults
AU - Lee Deville, Robert E.
AU - Mitra, Sayan
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70549109978&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70549109978&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-05118-0_16
DO - 10.1007/978-3-642-05118-0_16
M3 - Conference contribution
AN - SCOPUS:70549109978
SN - 3642051170
SN - 9783642051173
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 224
EP - 237
BT - Stabilization, Safety, and Security of Distributed Systems - 11th International Symposium, SSS 2009, Proceedings
T2 - 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009
Y2 - 3 November 2009 through 6 November 2009
ER -