Random walks in distributed computing: a survey

Authors:
Marc Bui;Thibault Bernard;Devan Sohier;Alain Bui
Affiliations:
LRIA – EPHE, Paris, France;Département de Mathématiques et Informatique, Université de Reims Champagne Ardennes, Reims cedex, France;Département de Mathématiques et Informatique, Université de Reims Champagne Ardennes, Reims cedex, France;Département de Mathématiques et Informatique, Université de Reims Champagne Ardennes, Reims cedex, France
Venue:
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Year:
2004

Citing 7
Cited 7

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
Random Leaders and Random Spanning Trees

Proceedings of the 3rd International Workshop on Distributed Algorithms
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 walks, universal traversal sequences, and the complexity of maze problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Generating random spanning trees

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A new method to automatically compute processing times for random walks based distributed algorithms

ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing

Fast distributed random walks

Proceedings of the 28th ACM symposium on Principles of distributed computing
A random walk model for infection on graphs

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Efficient distributed random walks with applications

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents

Discrete Event Dynamic Systems
Fast distributed computation in dynamic networks via random walks

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributed Random Walks

Journal of the ACM (JACM)
Coalescing-branching random walks on graphs

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this survey, we give an overview of the use of random walks as a traversal scheme to derive distributed control algorithms over a network of computers. It is shown that this paradigm for information exchange can be an attractive technique by using electric network theory as a mathematical tool for performance evaluation.