Cycling through a dangerous network: A simple efficient strategy for black hole search

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages

  Dobrev, Stefan ^a   Flocchini, Paola ^a   Santoro, Nicola ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Black hole search; Malicious host; Mobile agents; Undetectable failure

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER NETWORKS; MOBILE AGENTS; TOPOLOGY;

BLACK HOLE SEARCH; NODES;

ONLINE SEARCHING;

EID: 33947684882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.25     Document Type: Conference Paper

References (12)

1. J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Searching for a black hole in tree networks. In Proc. 8th Int. Conference on Principle of Distributed Systems (OPODIS'04), pp. 35-45, 2004.
2. S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Black hole search in in common interconnection networks. Networks, 2006.
3. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Dist. Comp., 2006.
4. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Mobile search for a black hole in an anonymous ring. Algorithmica, 2006. To appear.
5. S. Dobrev, P. Flocchini, and N. Santoro. Improved bounds for optimal black hole search in a network. In Proc. of 10th Int. Coll. on Structural Information and Communication Complexity, pp. 111-122, 2004.
6. O. Esparza, M. Soriano, J.J. Munoz, and J. Forne. Host revocation authority: A way of protecting mobile agents from malicious hosts. In Proc. Int. Conf. on Web Engineering (ICWE'03), LNCS 2722, 2003.
7. F. Hohl. A framework to protect mobile agents. In Proc. 20th Int. Conf. on Distr. Comp. Systems, 2000.
8. R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proc. 12th Int. Coll. Structural Inf. Comm. Complexity, pp. 200-215, 2005.
9. T. Sander and C. F. Tschudin. Protecting mobile agents against malicious hosts. In Proc. of Conf on Mobile Agent Security, pp. 44-60, 1998.
10. M.M. Syslo. An efficient cycle vector space algorithm for listing all cycles of a planar graph. SIAM Journal on Computing, 10(4):797-808, 1981.
11. Jan Vitek and Giuseppe Castagna. Mobile computations and hostile hosts. In D. Tsichritzis (Ed.), Mobile Objects, pp. 241-261. University of Geneva, 1999.
12. H. Whitney. Non-separable and planar graphs. Trans. Amer. Math. Soc., 34:339-362, 1932.