Random distributed self-stabilizing structures maintenance

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

Volumn 3061, Issue , 2004, Pages 231-240

  Bernard, Thibault ^a   Bui, Alain ^a   Flauzac, Olivier ^a  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

Author keywords

Distributed systems; Random walks; Self stabilization

Indexed keywords

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; RANDOM PROCESSES; STABILIZATION;

ASYNCHRONOUS MESSAGE-PASSING MODELS; DISTRIBUTED ENVIRONMENTS; DISTRIBUTED SYSTEMS; RANDOM WALK; SELF STABILIZATION; SPANNING TREE; STABILIZING SOLUTIONS; STABILIZING STRUCTURE;

MESSAGE PASSING;

EID: 35048902432     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25958-9_21     Document Type: Article

References (15)

1. R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Rackoff. Random walks, universal traversal sequences and the complexity of maze problems. In 20th Annual Symposium on Foundations of Computer Science, pages 218-223, 1979.
2. 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.
3. T. Bernard, A. Bui, M. Bui, and D. Sohier. A new method to automatically compute processing times for random walks based distributed algorithm. In ISPDC 03, Int. Symp. on Parallel and Distributed Computing, pages 31-37. IEEE CS Press, 2003.
4. A. Broder. Generating random spanning trees, pages 442-447. FOCS89 Proceedings of the 29st annual IEEE Symposium on foundation of computer sciences, 1989.
5. A. Bui, M. Bui, and D. Sohier. Randomly distributed tasks in bounded time. In I2CS, LNCS 2877, pages 36-47. Springer Verlag, 2003.
6. M. Bui, S. K. Das, A. K. Datta, and D. T. Nguyen. Randomized mobile agent based routing in wireless networks. International Journal of Foundations of Computer Science, 12(3):365-384, 2001.
7. E. W. Dijkstra. Self stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643-644, 1974.
8. S. Dolev. Self-Stabilization. MIT Press, 2000.
9. U. Feige. A tight lower bound for the cover time of random walks on graphs. Random structures and algorithms, 6(4):433-438, 1995.
10. U. Feige. A tight upper bound for the cover time of random walks on graphs. Random structures and algorithms, 6(1):51-54, 1995.
11. 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. A. Israeli and M. Jalfon. Token management schemes and random walks yield selfstabilizing mutual exclusion. In 9th ACM symposium on Principles of distributed computing, pages 119-131, 1990.
13. I. Lavallée. Algorithmique parallèle et distribuée. Hermès, 1990.
14. L. Lovász. Random walks on graphs: A survey. In T. Szõnyi ed. D. Miklós, V.T. Sós, editor, Combinatorics: Paul Erdos is Eighty (vol. 2), pages 353-398. János Bolyai Mathematical Society, 1993.
15. P. Tetali and P. Winkler. On a random walk problem arising in self-stabilizing token management. In 10th ACM symposium on Principles of distributed computing, pages 273-280, 1991.