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
Random Walks on Regular and Irregular Graphs
SIAM Journal on Discrete Mathematics
Random Leaders and Random Spanning Trees
Proceedings of the 3rd International Workshop on Distributed Algorithms
Innovative Internet Community Systems: 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005. Revised Papers (Lecture Notes in Computer Science)
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
Decentralized resources management for grid
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
On time analysis of random walk based token circulation algorithms
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
Random walks in distributed computing: a survey
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
| Hi-index | 0.00 |
Random walks constitute an attractive technique in distributed computing. In this paper, we present an original method using relationship between electrical resistance and random walks, to automatically compute quantities such as cover time, and more generally any processing time measure defined through hitting times. This method comes from electrical theory by using Millman's theorem.