Finite-state self-stabilizing protocols in message-passing systems

Authors:
Rodney R. Howell;Mikhail Nesterenko;Masaaki Mizuno
Affiliations:
Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas;Mathematics and Computer Science Department, Kent State University, Kent, Ohio;Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas
Venue:
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Year:
2002

Citing 9
Cited 3

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
The instability of self-stabilization

Acta Informatica
Stabilizing Communication Protocols

IEEE Transactions on Computers - Special issue on protocol engineering
Self-stabilization by local checking and correction (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Resource Bounds for Self-Stabilizing Message-Driven Protocols

SIAM Journal on Computing
Elements of network protocol design

Elements of network protocol design
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Self-stabilizing extensions for message-passing systems

Distributed Computing - Special issue: Self-stabilization
Self-stabilization over unreliable communication media

Distributed Computing - Special issue: Self-stabilization

Unifying stabilization and termination in message-passing systems

Distributed Computing
On the possibility and the impossibility of message-driven self-stabilizing failure detection

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Ideal stabilisation

International Journal of Grid and Utility Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a finite-state message-passing model using guarded commands. This model is particularly appropriate for defining and reasoning about self-stabilizing protocols, due to the well-known result that self-stabilizing protocols on unbounded-channel models must have infinitely many legitimate states. We argue that our model is more realistic than other models, and demonstrate its use with two simple examples. We then give a translation from this model to a lower-level model that uses a notion of time. We argue that this latter model is very close to a real network. We conclude by discussing how this translation might be used to implement self-stabilizing protocols on actual networks.