The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
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
IEEE Transactions on Parallel and Distributed Systems
Self-Stabilization by Counter Flushing
SIAM Journal on Computing
Random Leaders and Random Spanning Trees
Proceedings of the 3rd International Workshop on Distributed Algorithms
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
IEEE Transactions on Mobile Computing
Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
Journal of Parallel and Distributed Computing
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
The wandering token: Congestion avoidance of a shared resource
Future Generation Computer Systems
Note: The hitting and cover times of Metropolis walks
Theoretical Computer Science
Application of random walks to decentralized recommender systems
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
A tight lower bound on the cover time for random walks on graphs
Random Structures & Algorithms
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Meeting of Randomly Moving Messages in a Mobile ad-hoc Network
CISIS '11 Proceedings of the 2011 International Conference on Complex, Intelligent, and Software Intensive Systems
A distributed hierarchical clustering algorithm for large-scale dynamic networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.00 |
In this paper, we investigate random walk based token circulation in dynamic environments subject to faults. We describe hypotheses on the dynamic environment that allow random walks to meet the important property that the token visits any node infinitely often. The randomness of this scheme allows it to work on any topology, and requires no adaptation after a topological change, which is a desirable property for applications to dynamic systems. For random walks to be a traversal scheme and to solve the concurrency problem, one needs to guarantee that exactly one token circulates in the system. In the presence of transient faults, configurations with multiple tokens or with no token can occur. The meeting property of random walks solves the cases with multiple tokens. The reloading wave mechanism we propose, together with timeouts, allows us to detect and solve cases with no token. This traversal scheme is self-stabilizing, and universal, meaning that it needs no assumption on the system topology. We describe conditions on the dynamicity (with a local detection criterion) under which the algorithm is tolerant to dynamic reconfigurations. We conclude with a study on the time between two visits of the token to a node, which we use to tune the parameters of the reloading wave mechanism according to some system characteristics.