Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
On a random walk problem arising in self-stabilizing token management
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
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
Self-Stabilization by Counter Flushing
SIAM Journal on Computing
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Random Walk for Self-Stabilizing Group Communication in Ad-Hoc Networks
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
The wandering token: Congestion avoidance of a shared resource
Future Generation Computer Systems
On time analysis of random walk based token circulation algorithms
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
| Hi-index | 0.00 |
In this paper, we combine random walks and self-stabilization to design a single token circulation algorithm. Random walks have proved their efficiency in dynamic networks and are perfectly adapted to frequent network topological changes. Self-stabilization is the most general technique to design an algorithm that tolerates transient failures. Taking account that the token circulates continually according to a random walk scheme, designing a self-stabilizing algorithm implies to solve two situations (1) no token in the system and (2) several tokens in the system. The former is generally solved by a time-out mechanism, upon timeout a new token is created. In this paper, we focus on this problem. Just state that one may choose a sufficiently long time-out period is not possible in our case: the system could never stabilize. Indeed, a random walk based token eventually cover the network but only the expected time to cover the network can be captured. Therefore, we introduce a mechanism “the reloaded wave propagation” to prevent unnecessary token creation and preserve self-stabilization properties.