Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Self-stabilizing multicast protocols for ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Brief announcement: concurrent maintenance of rings
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Journal of Parallel and Distributed Computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Self-stabilising protocols on oriented chains with joins and leaves
International Journal of Autonomous and Adaptive Communications Systems
Hi-index | 0.00 |
It is generally said that a self-stabilizing protocol is inefficient in distributed systems with frequent faults or topological changes and, what is worse, it might never converge to its intended behavior forever. Its main reason is that a new fault or topological change brings the system into an unexpected configuration, and thus, the system restarts convergence to its intended behavior from scratch. But the reasoning seems too pessimistic. This paper provides a novel observation about self-stabilization on frequently changing networks: by quantifying influence of steps of a self-stabilizing protocol and that of a topological change, efficiency of the convergence can be estimated with considering topological changes that occur during the convergence. To show the feasibility and effectiveness of the approach, this paper presents a simple self-stabilizing mutual exclusion protocol on a dynamic ring where processes can join and leave the ring at any time. This paper clarifies what restrictions on frequency of joins and leaves are sufficient to guarantee the convergence and to guarantee the intended behavior after the convergence. The restrictions are not strict and thus the protocol can complete convergence and can continue its intended behavior on a frequently changing ring.