Multiple agents rendezvous in a ring in spite of a black hole

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

Volumn 3144, Issue , 2004, Pages 34-46

  Dobrev, Stefan ^a   Flocchini, Paola ^a   Prencipe, Giuseppe ^b   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF PISA   (Italy)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Anonymous; Asynchronous; Black Hole; Distributed Computing; Gathering; Harmful Host; Mobile Agents; Rendezvous; Ring Network

Indexed keywords

COMPLEX NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; GRAVITATION; LOCATION; MULTI AGENT SYSTEMS; STARS;

ANONYMOUS; ASYNCHRONOUS; BLACK HOLES; GATHERING; HARMFUL HOST; RENDEZVOUS; RING NETWORKS;

MOBILE AGENTS;

EID: 35048857421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27860-3_6     Document Type: Article

References (19)

1. th ACM-SIAM Symposium on Discrete Algorithms (SODA '02). (2002) 568-577
2. th ACM Symp. on Parallel Algorithms and Architectures (SPAA '02). (2002) 200-209
3. th Colloquium on Structural Information and Communication complexity (SIROCCO '03). (2003) 17-32
4. Panaite, P., Pelc, A.: Exploring unknown undirected graphs. Journal of Algorithms 33 (1999) 281-295
5. Alpern, S.: The rendezvous search problem. SIAM Journal of Control and Optimization 33 (1995) 673-683
6. Alpern, S., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability 36 (1999) 223-231
7. Andersen, E., R.R.Weber: The rendezvous problem on discrete locations. Journal of Applied Probability 28 (1990) 839-851
8. th Annual European Symposium on Algorithms (ESA '03). (2003)
9. rd International Conference on Distributed Computing Systems (ICDCS'03). (2003)
10. Yu, X., Yung, M.: Agent rendezvous: A dynamic symmetry-breaking problem. In: ICALP '96. LNCS 1099 (1996) 610-621
11. P.Flocchini, Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple mobile agent rendezvous in a ring. In: LATIN '04. (2004) accepted for publication.
12. Lim, W., Beck, A., Alpern, S.: Rendezvous search on the line with more than two players. Operations Research 45 (1997) 357-364
13. amd P.B. Hulme, L.T.: Searching for targets who want to be found. Journal of the Operations Research Society 48 (1997) 44-50
14. Hohl, F.: A framework to protect mobile agents by using reference states. In: International Conference on Distributed Computing Systems (ICDCS '00). (2000)
15. Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. Mobile Agents and Security (LNCS 1419) (1999) 44-60
16. Vitek, J., Castagna, G. In: Mobile Computations and Hostile Hosts. University of Geneva (1999) 241-261
17. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile agents searching for a black hole in an anonymous ring. In: Proc. of 15th Int. Symposium on Distr. Computing (DISC 2001). (2001) 166-179
18. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Finding a black hole in an arbitrary network: optimal mobile agents protocols. In: Proc. of 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). (2002) 153-162
19. th International Conference on Principles of Distributed Systems (OPODIS '02). (2002) 171-182