Random walks in distributed computing: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3473 LNCS, Issue , 2006, Pages 1-14

  Bui, Marc ^b   Bernard, Thibault ^a   Sohier, Devan ^a,b   Bui, Alain ^a  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b PSL RESEARCH UNIVERSITY   (France)

Author keywords

Distributed Algorithms; Distributed System; Electrical Network; Random Walks

Indexed keywords

ALGORITHMS; CIRCUIT THEORY; FUNCTION EVALUATION; INFORMATION ANALYSIS; MATHEMATICAL TECHNIQUES; THEOREM PROVING;

DISTRIBUTED ALGORITHMS; ELECTRICAL NETWORK; RANDOM WALKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33744791145     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11553762_1     Document Type: Conference Paper

References (15)

1. +79. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences and the complexity of maze problems. In 20th IEEE Annual Symposium on Foundations of Computer Science, pages 218-223, October 1979.
2. BBBS03. T Bernard, A Bui, M Bui, and D Sohier. A new method to automatically compute processing times for random walks based distributed algorithm. In Marcin Paprzycki, editor, ISPDC 03, Second IEEE International Symposium on Parallel and Distributed Computing Proceeding, volume 2069, pages 31-36. IEEE Computer society Press, 2003.
3. BBF04. T Bernard, A Bui, and O Flauzac. Random distributed self-stabilizing structures maintenance. In Victor Larios Félix F. Ramos, Herwig Unger, editor, ISADS'04, IEEE Internationnal Symposium on Advanced Distributed Systems Proceedings, volume 3061, pages 231 - 240. Springer Verlag (LNCS), January 2004.
4. BBS03. A Bui, M Bui, and D Schier. Randomly distributed tasks in bounded time. In Innovative Internet Community System, volume 2877, pages 36-47. Springer Verlag (LNCS), 2003.
5. BDDN01. Marc Bui, Sajal K. Das, Ajoy Kumar Datta, and Dai Tho Nguyen. Randomized mobile agent based routing in wireless networks. International Journal of Foundations of Computer Science, 12(3):365-384, 2001.
6. +03. H Baala, O Flauzac, J Gaber, M Bui, and T El-Ghazawi. A self-stabilizing distributed algorithm for spanning tree construction in wireless ad-hoc network. Journal of Parallel and Distributed Computing, 63(1):97-104, 2003.
7. BIZ89. J Bar-Ilan and D Zernik. Random leaders and random spanning trees. In WDAG89, pages 1,12, 1989.
8. Bro89. AZ Broder. Generating random spanning trees, pages 442-441. FOCS89 Proceedings of the 29st annual IEEE Symposium on foundation of computer sciences, 1989.
9. +97. Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, and Prasoon Tiwari. The electrical resistance of a graph captures its commute and cover times. Computational Complexity, 6(4), 1997.
10. DS00. Peter G. Doyle and J. Laurie Snell. Random Walks and Electric Networks. 2000.
11. Fla01. O Flauzac. Random circulating word information management for tree construction and shortest path routing tables computation. In On Principle Of Distributed Systems, pages 17-32. Studia Informatica Universalis, 2001.
12. IJ90. A Israeli and M Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC90, Proceeding of the ninth ACM Annual Symposium on Principles of distributed Computing, pages 119-131, 1990.
13. Lov93. Laszlo Lovasz. Random walks on graphs: A survey. In T. Szonyi ed. D. Miklos, V. T. Sos, editor, Combinatorics: Paul Erdos is Eighty (vol. 2), pages 353-398. Janos Bolyai Mathematical Society, 1993.
14. Tet91. P Tetali. Random walks and effective resistance of networks. J. Theoretical Probability, 1:101,109, 1991.
15. TW91. P Tetali and P Winkler. On a random walk arising in self-stabilizing token management. In PODC9I, Proceeding of the tenth ACM Annual Symposium on Principles of distributed Computing, pages 273-280, 1991.