Randomly distributed tasks in bounded time

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

Volumn 2877, Issue , 2003, Pages 36-47

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

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b PSL RESEARCH UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

HITTING TIME; PROCESSING TIME; RANDOM WALK; RANDOMLY DISTRIBUTED; THE STANDARD MODEL;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0242424274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39884-4_4     Document Type: Article

References (17)

1. D. Aldous and J.A. Fill. Reversible Markov Chains and Random Walks on graphs. (book draft).
2. 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.
3. Andrei Z. Broder, Allan M. Frieze, Stephen Suen, and Eli Upfal. Optimal construction of edge-disjoint paths in random graphs. In SODA: ACM-SIAM Symposium on Discrete Algorithms, 1994.
4. A Bui, M Bui, and C Lavault. On the hierarchy of functioning rules in distributed computing. RAIRO operations research, 33(1):15-27, 1999.
5. 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. 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.
7. Don Coppersmith, Uriel Feige, and James Shearer. Random walks on regular and irregular graphs. SIAM Journal on Discrete Mathematics, (9(2)):301-308, 1996.
8. Peter G. Doyle and J. Laurie Snell. Random Walks and Electric Networks. 2000 (first edition 1984 Mathematical Association of America).
9. M. Duflot, L. Fribourg, and C. Picaronny. Randomized finite-state distributed algorithms as markov chains. In 15th Int; Conf. on Distributed Computing (DISC'2001), pages 240-254. LNCS, Springer-Verlag, 2001.
10. U Feige. A tight lower bound for the cover time of random walks on graphs. Random structures and algorithms, 6(4):433-438, 1995.
11. U Feige. A tight upper bound for the cover time of random walks on graphs. Random structures and algorithms, 6(1):51-54, 1995.
12. O. Flauzac, M. Krajecki, and J. Fugere. Confiit: a middleware for peer to peer computing. In ICCSA 2003 International Conference on Computational Science ans its Applications. LNCS, Springer-Verlag, to appear, 2003.
13. I. Foster and C. Kesselman. The GRID: Blueprint for a new Computing Infrastructure, chapter 2. Morgan Kauffman, 1998.
14. Ian Foster, Carl Kesselman, and Steven Tuecke. The anatomy of the Grid: Enabling scalable virtual organizations. Lecture Notes in Computer Science, 2150, 2001.
15. Amos Israeli and Marc Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In 9th ACM symposium on Principles of distributed computing, pages 119-131, 1990.
16. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer-Verlag, 1976.
17. Lászlo 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.