TY - GEN
T1 - Optimal time self stabilization in dynamic systems
AU - Dolev, Shlomi
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993/1/1
Y1 - 1993/1/1
N2 - A self-stabilizing system is a distributed system which can tolerate any number and any type of faults in the history. After the last fault occurs the system starts to converge to a legitimate behavior. The self-stabilization property is very useful for systems in which processors may malfunction for a while and then recover. When there is a long enough period during which no processor malfunctions the system stabilizes. Dynamic systems are systems in which communication links and processors may fail and recover during normal operation. Such failures could cause partitioning of the system communication graph. The application of self-stabilizing protocols to dynamic systems is natural. Following the last topology change each connected component of the system stabilizes independently. We present time optimal self-stabilizing dynamic protocols for a variety of tasks including: routing, leader election and topology update. The protocol for each of those tasks stabilizes in Θ(d) time, where d is the actual diameter of the system.
AB - A self-stabilizing system is a distributed system which can tolerate any number and any type of faults in the history. After the last fault occurs the system starts to converge to a legitimate behavior. The self-stabilization property is very useful for systems in which processors may malfunction for a while and then recover. When there is a long enough period during which no processor malfunctions the system stabilizes. Dynamic systems are systems in which communication links and processors may fail and recover during normal operation. Such failures could cause partitioning of the system communication graph. The application of self-stabilizing protocols to dynamic systems is natural. Following the last topology change each connected component of the system stabilizes independently. We present time optimal self-stabilizing dynamic protocols for a variety of tasks including: routing, leader election and topology update. The protocol for each of those tasks stabilizes in Θ(d) time, where d is the actual diameter of the system.
UR - http://www.scopus.com/inward/record.url?scp=85028854219&partnerID=8YFLogxK
U2 - 10.1007/3-540-57271-6_34
DO - 10.1007/3-540-57271-6_34
M3 - Conference contribution
AN - SCOPUS:85028854219
SN - 9783540572718
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 160
EP - 173
BT - Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
A2 - Schipe, Andre
PB - Springer Verlag
T2 - 7th International Workshop on Distributed Algorithms, WDAG 1993
Y2 - 27 September 1993 through 29 September 1993
ER -