Locating and repairing faults in a network with mobile agents

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

Volumn 5058 LNCS, Issue , 2008, Pages 20-32

  Cooper, Colin ^a   Klasing, Ralf ^b   Radzik, Tomasz ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Distributed computing; Graph exploration; Mobile agents

Indexed keywords

AGENTS; CHLORINE COMPOUNDS; MAINTENANCE; MOBILE AGENTS; REPAIR;

ASYMPTOTIC OPTIMALITY; COMMUNICATION COMPLEXITIES; DISTRIBUTED COMPUTING; FAULTY NODES; GRAPH EXPLORATION; NUMBER OF NODES; STRUCTURAL INFORMATIONS;

SOFTWARE AGENTS;

EID: 48249110937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69355-0_4     Document Type: Conference Paper

References (16)

1. Cooper, C., Klasing, R., Radzik, T.: Searching for black-hole faults in a network using multiple agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 320-332. Springer, Heidelberg (2006)
2. Czyzowicz, J., Kowalski, D.R., Markou, E., Pelc, A.: Searching for a black hole in tree networks. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 67-80. Springer, Heidelberg (2005)
3. Czyzowicz, J., Kowalski, D., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae 71(2-3), 229-242 (2006)
4. Dobrev, S., Flocchini, P., Kralovic, R., Ruzicka, P., Prencipe, G., Santoro, N.: Black hole search in common interconnection networks. Networks 47(2), 61-71 (2006); (Preliminary version: Black hole search by mobile agents in hypercubes and related networks. In: Proceedings of the 6th International Conference on Principles of Distributed Systems, OPODIS 2002, pp. 169-180 (2002))
5. Dobrev, S., Flocchini, P., Kralovic, R., Santoro, N.: Exploring an unknown graph to locate a black hole using tokens. In: Navarro, G., Bertossi, L., Kohayakwa, Y. (eds.) Fourth IFIP International Conference on Theoretical Computer Science, TCS 2006. IFIP International Federation for Information Processing, vol. 209, pp. 131-150. Springer, Heidelberg (2006)
6. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48(1), 67-90 (2007); (Preliminary version in: Distributed Computing. In: 15th International Conference, DISC 2001, Proceedings. LNCS, vol. 2180, pp. 166-179. Springer, Heidelberg (2001)
7. Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Searching for a black hole in arbitrary networks: Optimal mobile agents protocols. Distributed Computing 19(1), 1-18 (2006); (Preliminary version in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, PODC 2002, pp. 153-161. ACM, New York (2002)
8. Dobrev, S., Kralovic, R., Santoro, N., Shi, W.: Black hole search in asynchronous rings using tokens. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 139-150. Springer, Heidelberg (2006)
9. Flocchini, P., Santoro, N.: Distributed security algorithms by mobile agents. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol. 4308, pp. 1-14. Springer, Heidelberg (2006)
10. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178-193 (1978)
11. Hohl, F.: Time limited blackbox security: Protecting mobile agents from malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol. 1419, pp. 92-113. Springer, Heidelberg (1998)
12. Hohl, F.: A framework to protect mobile agents by using reference states. In: Proceedings of the 20th International Conference on Distributed Computing Systems, ICDCS 2000, pp. 410-417. IEEE Computer Society, Los Alamitos (2000)
13. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Approximation bounds for black hole search problems. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974. Springer, Heidelberg (2006)
14. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theor. Comput. Sci. 384(2-3), 201-221 (2007); (Preliminary version in: Structural Information and Communication Complexity. In: 12th International Colloquium, SIROCCO 2005, Proceedings. LNCS, vol. 3499, pp. 200-215. Springer, Heidelberg (2005)
15. Ng, S.K., Cheung, K.W.: Protecting mobile agents against malicious hosts by intention spreading. In: Arabnia, H.R. (ed.) Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 1999. CSREA Press, pp. 725-729 (1999)
16. Sander, T., Tschudin, C.: Protecting mobile agents against malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol. 1419, pp. 44-60. Springer, Heidelberg (1998)