TY - GEN
T1 - Probabilistic self-stabilization and random walks
AU - Yamashita, Masafumi
PY - 2011
Y1 - 2011
N2 - A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers legitimate computation, but only probabilistically unlike a self-stabilizing system. After introducing the notion of probabilistic self-stabilizing systems, we discuss how to design probabilistic self-stabilizing algorithms.
AB - A distributed system is said to be probabilistic self-stabilizing, if it eventually converges to legitimate computation with probability 1, starting from any global configuration. Like a self-stabilizing system, a probabilistic self-stabilizing system tolerates any number of transient failures and recovers legitimate computation, but only probabilistically unlike a self-stabilizing system. After introducing the notion of probabilistic self-stabilizing systems, we discuss how to design probabilistic self-stabilizing algorithms.
UR - http://www.scopus.com/inward/record.url?scp=84856829804&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856829804&partnerID=8YFLogxK
U2 - 10.1109/ICNC.2011.11
DO - 10.1109/ICNC.2011.11
M3 - Conference contribution
AN - SCOPUS:84856829804
SN - 9780769545691
T3 - Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
SP - 1
EP - 7
BT - Proceedings - 2011 2nd International Conference on Networking and Computing, ICNC 2011
T2 - 2nd International Conference on Networking and Computing, ICNC 2011
Y2 - 30 November 2011 through 2 December 2011
ER -