Time optimal algorithms for black hole search in rings

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

Volumn 6509 LNCS, Issue PART 2, 2010, Pages 58-71

  Balamohan, Balasingham ^a   Flocchini, Paola ^a   Miri, Ali ^b   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b RYERSON UNIVERSITY   (Canada)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; AVERAGE CASE; AVERAGE-CASE COMPLEXITY; BLACK HOLE SEARCH; BLACK HOLES; FINITE TIME; MOBILE ENTITIES; NETWORK ENVIRONMENTS; RING NETWORKS; SEARCH PROBLEM; TIME COMPLEXITY; TIME COST; TIME UNITS; TIME-OPTIMAL ALGORITHM; WORST CASE;

ALGORITHMS; BEVERAGES; COMBINATORIAL OPTIMIZATION; GRAVITATION; PROBLEM SOLVING; STARS; COMPLEX NETWORKS; MOBILE AGENTS; OPTIMIZATION;

MOBILE AGENTS; SOFTWARE AGENTS;

EID: 78650804993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17461-2_5     Document Type: Conference Paper

References (24)

1. Bender, M.A., Fernández, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. Information and Computation 176(1), 1-21 (2002)
2. 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)
3. Czyzowicz, J., Dobrev, S., Královic, R., Miklík, S., Pardubská, D.: Black hole search in directed graphs. In: Kutten, S., Žerovnik, J. (eds.) SIROCCO 2009. LNCS, vol. 5869, pp. 182-194. Springer, Heidelberg (2009)
4. Czyzowicz, J., Kowalski, D.R., Markou, E., Pelc, A.: Complexity of searching for a black hole. Fundamenta Informaticae 71(2-3), 229-242 (2006)
5. Czyzowicz, J., Kowalski, D.R., Markou, E., Pelc, A.: Searching for a black hole in synchronous tree networks. Combinatorics, Probability & Computing 16(4), 595-619 (2007)
6. Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. J. Graph Theory 32(3), 265-297 (1999)
7. 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)
8. Dobrev, S., Flocchini, P., Kralovic, R., Santoro, N.: Exploring an unknown graph to locate a black hole using tokens. In: 5th IFIP Int. Conference on Theoretical Computer Science (TCS), pp. 131-150 (2006)
9. 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-19 (2006) (Pubitemid 44290696)
10. Dobrev, S., Flocchini, P., Santoro, N.: Improved bounds for optimal black hole search with a network map. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 111-122. Springer, Heidelberg (2004)
11. Dobrev, S., Flocchini, P., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48, 67-90 (2007) (Pubitemid 47136629)
12. Dobrev, S., Santoro, N., Shi, W.: Using scattered mobile agents to locate a black hole in an un-oriented ring with tokens. International Journal of Foundations of Computer Science 19(6), 1355-1372 (2008)
13. Flocchini, P., Ilcinkas, D., Santoro, N.: Ping pong in dangerous graphs: Optimal black hole search with pure tokens. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 227-241. Springer, Heidelberg (2008)
14. Flocchini, P., Kellett, M., Mason, P., Santoro, N.: Map construction and exploration by mobile agents scattered in a dangerous network. In: 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1-10 (2009)
15. Flocchini, P., Santoro, N.: Distributed security algorithms for mobile agents. In: CaO, J., Das, S.K. (eds.) Mobile Agents in Networking and Distributed Computing, ch. 3. Wiley, Chichester (2009)
16. Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science 345(2-3), 331-344 (2005)
17. Garay, J.A., Kutten, S., Peleg, D.: A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM J. Comput. 27(1), 302-316 (1998)
18. Glaus, P.: Locating a black hole without the knowledge of incoming link. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 128-138. Springer, Heidelberg (2009)
19. Chalopin, J., Das, S., Santoro, N.: Rendezvous of mobile agents in unknown graphs with faulty links. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 108-122. Springer, Heidelberg (2007)
20. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Hardness and approximation results for black hole search in arbitrary networks. Theoretical Computer Science 384(2-3), 201-221 (2007)
21. Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Approximation bounds for black hole search problems. Networks 52(4), 216-226 (2008)
22. Královic, R., Miklík, S.: Periodic data retrieval problem in rings containing a malicious host. In: Patt-Shamir, B., Ekim, T. (eds.) Structural Information and Communication Complexity. LNCS, vol. 6058, pp. 157-167. Springer, Heidelberg (2010)
23. Kutten, S., Peleg, D.: Fast distributed construction of small k-dominating sets and applications. J. Algorithms 28(1), 40-66 (1998)
24. Shi, W.: Black hole search with tokens in interconnected networks. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 670-682. Springer, Heidelberg (2009)