Black hole search in asynchronous rings using tokens

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

Volumn 3998 LNCS, Issue , 2006, Pages 139-150

  Dobrev, S ^a   Kralovic R ^b   Santoro, N ^c   Shi, W ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b Faculty of Natural Sciences   (Slovakia)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER NETWORKS; MATHEMATICAL MODELS;

ASYNCHRONOUS RING NETWORK; BLACK HOLE SEARCH; TOKENS; WHITEBOARDS;

SOFTWARE AGENTS;

EID: 33746078073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_16     Document Type: Conference Paper

References (14)

1. L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Election and rendezvous in fully anonymous systems with sense of direction. Theory of Computing Systems, 2006. To appear. Preliminary version in Proc. of SIROCCO 2003.
2. D. M. Chess. Security issues in mobile code systems. In Proc. Conf. on Mobile Agent Security, LNCS 1419, pages 1-14, 1998.
3. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Searching for a black hole in tree networks. In Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004), pages 35-45, 2004.
4. S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Optimal search for a black hole in common interconnection networks. Networks, 2006. To appear. Preliminary version in Proc. of OPODIS 2002.
5. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile search for a black hole in an anonymous ring. Algorithmica, 2006. To appear. Preliminary version in Proc. of DISC 2001.
6. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in a arbitrary networks: optimal mobile agent protocols. Distributed Computing, 2006. To appear. Preliminary version in Proc. of PODC 2002.
7. S. Dobrev, P. Flocchini, and N. Santoro. Improved bounds for optimal black hole search in a network with a map. In Proc. of 10th International Colloquium on Structural Information and Communication Complexity, pages 111-122, 2004.
8. P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc. Collective tree exploration. In 6th Latin American Theoretical Informatics Symp., pages 141-151, 2004.
9. P. Fraigniaud and D. Ilcinkas. Digraph exploration with little memory. In 21st Symp. on Theoretical Aspects of Computer Science, pages 246-257, 2004.
10. M.S. Greenberg, J.C. Byington, and D. G. Harper. Mobile agents and security. IEEE Commun. Mag., 36(7):76-85, 1998.
11. F. Hohl. A model of attacks of malicious hosts against mobile agents. In Proc. of the ECOOP Workshop on Distributed Object Security and 4th Workshop on Mobile Object Systems, LNCS 1603, pages 105-120, 1998.
12. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proc. 12th Coll. on Structural Information and Communication complexity (SIROCCO'05), pages 200-215, 2005.
13. R. Oppliger. Security issues related to mobile code and agent-based systems. Computer Communications, 22(12):1165-1170, 1999.
14. T. Sander and C. F. Tschudin. Protecting mobile agents against malicious hosts. In Proc. of Conf on Mobile Agent Security, LNCS 1419, pages 44-60, 1998.