Black hole search in common interconnection networks

Networks

Volumn 47, Issue 2, 2006, Pages 61-71

  Dobrev, S ^a   Flocchini, P ^a   Kralovic R ^b   Ruzicka P ^b   Prencipe, G ^c   Santoro, N ^d  

^a UNIVERSITY OF OTTAWA   (Canada)

^b Faculty of Natural Sciences   (Slovakia)

^c UNIVERSITY OF PISA   (Italy)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

Anonymous networks; Biconnected graphs; Distributed mobile computing; Distributed search; Interconnection networks; Malicious host; Mobile agents; Traversal pair

Indexed keywords

COST EFFECTIVENESS; GRAPH THEORY; INTELLIGENT AGENTS; MOBILE COMPUTING; TOPOLOGY;

ANONYMOUS NETWORKS; BICONNECTED GRAPHS; DISTRIBUTED MOBILE COMPUTING; DISTRIBUTED SEARCH; MALICIOUS HOST; MOBILE AGENTS; TRAVERSAL PAIR;

INTERCONNECTION NETWORKS;

EID: 33645140802     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20095     Document Type: Article

References (23)

1. S. Alberts and M.R. Henzinger, Exploring unknown environments, SIAM J Comput 29 (2000), 1164-1188.
2. W. Allcock, A. Chervenak, I. Foster, C. Kesselman, C. Salisbury, and S. Tuecke, The data grid: Towards an architecture for the distributed management and analysis of large scientific dataset, J Network Comput Appl 2002.
3. E. Arkin, M. Bender, S. Fekete, and J. Mitchell, "The freeze-tag problem: How to wake up a swarm of robots," 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), 2002, pp. 568-577.
4. D.M. Chess, "Security issues in mobile code systems," Conference on Mobile Agent Security, LNCS 1419, 1998, pp. 1-14.
5. A. Dessmark, P. Fraigniaud, and A. Pelc, "Deterministic rendezvous in graphs," 11th Annual European Symposium on Algorithms (ESA '03), 2003, pp. 184-195.
6. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, "Tree exploration with little memory," 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), 2002, pp. 588-597.
7. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, "Mobile agents searching for a black hole in an anonymous ring," 15th Int. Symposium on Distributed Computing (DISC 2001), 2001, pp. 166-179.
8. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro, "Finding a black hole in an arbitrary network: Optimal mobile agents protocols," 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), 2002, pp. 153-162.
9. P. Fraigniaud, L. Gasieniec, D.R. Kowalski, and A. Pelc, "Collective tree exploration," 6th Latin American Theoretical Informatics Symposium 2004, 2004, pp. 141-151.
10. P. Fraigniaud and D. Ilcinkas, "Directed graph exploration with little memory," 21 st Symposium on Theoretical Aspects of Computer Science (STAGS 2004), 2004, pp. 246-257.
11. M.S. Greenberg, J.C. Byington, and D.G. Harper, Mobile agents and security, IEEE Commun Mag 36 (1998), 76-85.
12. N. Hanusse, D. Kavvadias, E. Kranakis, and D. Krizanc, "Memoryless search algorithms in a network with faulty advice," 2nd IFIP International Conference on Theoretical Computer Science (TCS '02), 2002, pp. 206-216.
13. F. Hohl, "Time limited blackbox security: Protecting mobile agents from malicious hosts," Conference on Mobile Agent Security, LNCS 1419, 1998, pp. 92-113.
14. F. Hohl. "A framework to protect mobile agents by using reference states," 20th International Conference on Distributed Computing Systems (ICDCS 2000), 2000.
15. L.M. Kirousis, E. Kranakis, D. Krizanc, and Y. Stamatiou, "Locating information with uncertainty in fully interconnected networks," 14th International Symposium on Distributed Computing (DISC 2000), LNCS 1914, 2000, pp. 283-296.
16. FT. Leighton, Introduction to parallel algorithms and architectures: Arrays, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992.
17. R. Oppliger, Security issues related to mobile code and agent-based systems, Comput Communs 22 (1999), 1165-1170.
18. P. Panaite and A. Pelc, Exploring unknown undirected graphs, J Algorithms 33 (1999), 281-295.
19. T. Sander and C.F. Tschudin, "Protecting mobile agents against malicious hosts," Conference on Mobile Agent Security, LNCS 1419, 1998, pp. 44-60.
20. K. Schelderup and J. Ones, "Mobile agent security - Issues and directions," 6th Int. Conf. on Intelligence and Services in Networks, LNCS 1597, 1999, pp. 155-167.
21. S.K. Ng and K.W. Cheung, "Protecting mobile agents against malicious hosts by intention spreading," 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), 1999, pp. 725-729.
22. J. Vitek and G. Castagna, "Mobile computations and hostile hosts," Mobile objects, D. Tsichritzis (Editor), University of Geneva, 1999.
23. X. Yu and M. Yung, "Agent rendezvous: A dynamic symmetry-breaking problem," 23rd International Colloquium on Automata, Languages, and Programming (ICALP '96), LNCS 1099, 1996, pp. 610-621.