Distributed security algorithms by mobile agents

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

Volumn 4308 LNCS, Issue , 2006, Pages 1-14

  Flocchini, Paola ^a   Santoro, Nicola ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PARADIGM; COMPUTING ENVIRONMENTS; DISTRIBUTED SECURITY; MESSAGE-PASSING SETTINGS; MOBILE AGENTS SYSTEMS; PROBLEMS AND SOLUTIONS; PROGRAMMING PARADIGMS; SELFISH BEHAVIOURS;

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; GRAPH THEORY; MOBILE AGENTS; OBJECT ORIENTED PROGRAMMING; SOFTWARE ENGINEERING; VIRUSES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84885235586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11947950_1     Document Type: Conference Paper

References (56)

1. S. Albers, M. Henzinger. "Exploring unknown environments". Proc. 29th Annu. ACM Sympos. Theory Comput., 416-425, 1997.
2. S. Alpern, S. Gal. The Theory of Search Games and Rendezvous. Kluwer, 2003.
3. M. Asaka, S. Okazawa, A. Taguchi, S. Goto. "A method of tracing intruders by use of mobile agent". INET, www.isoc.org, 1999.
4. B. Awerbuch, M. Betke, M. Singh. Piecemeal graph learning by a mobile robot. Information and Computation 152, 155-172, 1999.
5. L. Barrière, P. Flocchini, P. Fraigniaud, N. Santoro. "Capture of an intruder by mobile agents". Proc. 14th ACM-SIAM Symp. on Parallel Algorithms and Architectures (SPAA), 200-209, 2002.
6. L. Barrière, P. Flocchini, P. Fraigniaud, N. Santoro. "Can we elect if we cannot compare?" in Proc. 15th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 200-209, 2003.
7. L. Barriere, P. Flocchini, P. Fraigniaud, N. Santoro. "Election and rendezvous in fully anonymous systems with sense of direction". In Theory of Computer System, to appear.
8. L. Barrière, P. Fraigniaud, N. Santoro, D.M. Thilikos. "Searching is not jumping". Proc. 29th Int. Workshop on Graph Theoretic Concepts in Computer Science (WG), LNCS 2880, 34-45, 2003.
9. M. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan. "The power of a pebble: Exploring and mapping directed graphs". In Proc. 30th ACM Symp. on Theory of Computing (STOC), 269-287, 1998.
10. M. Bender, D. K. Slonim. "The power of team exploration: two robots can learn unlabeled directed graphs". In Proc. 35th Symp. on Foundations of Computer Science (FOCS), 75-85, 1994.
11. L. Blin, P. Fraigniaud, N. Nisse, S. Vial. "Distributed chasing of network intruders by mobile agents". Proc. of the 13th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), 70-84, 2006.
12. C. Cooper, R. Klasing, T. Radzik "Searching for black-hole faults in a network using multiple agents". Proc. 10th Int. Conf. on Principle of Distributed Systems (OPODIS), 2006.
13. J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc. "Searching for a black hole in tree networks". Proc. 8th Int. Conf. on Principle of Distributed Systems (OPODIS), 35-45, 2004.
14. J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc. "Complexity of searching for a black hole". Fundamenta Informaticae, 71(2-3), 229-242, 2006. 35-45, 2004.
15. S. Das, P. Flocchini, A. Nayak, N. Santoro. "Exploration and labelling of an unknown graph by multiple agents" Proc. 12th Int. Coll. on Structural Information and Communication Complexity, (SIROCCO), 99-114, 2005.
16. S. Das, P. Flocchini, A. Nayak, N. Santoro. "Effective elections for anonymous mobile agents". Proc. 17th Int. Symp. on Algorithms and Computation (ISAAC), 2006.
17. X. Deng, C. H. Papadimitriou, "Exploring an unknown graph". J. of Graph Theory 32(3), 265-297, 1999.
18. A. Dessmark, P. Fraigniaud, A. Pelc. "Deterministic rendezvous in graphs". In Proc. 11th European Symp. on Algorithms (ESA), 184-195, 2003.
19. A. Dessmark, A. Pelc. "Optimal graph exploration without good maps". In Proc. 10th European Symp. on Algorithms (ESA), 374-386, 2002.
20. K. Diks, P. Fraigniaud, E. Kranakis, A. Pelc. "Tree exploration with little memory". Journal of Algorithms, 51:38-63, 2004.
21. S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro. "Mobile search for a black hole in an anonymous ring". Algorithmica, to appear.
22. S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro. "Multiple agents rendezvous in a ring in spite of a black hole". Proc. 6th Int. Symp. on Principles of Distributed Systems (OPODIS) 34-46, 2003.
23. S. Dobrev, P. Flocchini, G. Prencipe, N. Santoro. "Searching for a black hole in arbitrary networks: optimal mobile agents protocols". Distributed Computing, to appear.
24. S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, N. Santoro. "Optimal search for a black hole in common interconnection networks". Networks, 47 (2), p. 61-71, 2006.
25. S. Dobrev, P. Flocchini, N. Santoro. "Improved bounds for optimal black hole search in a network with a map. Proc. 10th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), 111-122, 2004.
26. S. Dobrev, P. Flocchini, R. Kralovic, N. Santoro. "Exploring a dangerous unknown graph using tokens". Proc. 5th IFIP Int. Conf. on Theoretical Computer Science (TCS), 131-150, 2006.
27. S. Dobrev, P. Flocchini, N. Santoro. "Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search". Int. Conf. on Distributed computing Systems (ICDCS), 2006.
28. S. Dobrev, R. Kralovic, N. Santoro, W. Shi. "Black Hole Search in Asynchronous Rings Using Tokens". Proc. 6th Conf. on Algorithms and Complexity (CIAC), 139-150, 2006.
29. G. Dudek, M. Jenkin, E. Milios, D. Wilkes. "Robotic exploration as graph construction". Transactions on Robotics and Automation, 7(6):859-865, 1991.
30. J. Ellis, H. Sudborough, J. Turner. "The vertex separation and search number of a graph". Information and Computation, 113(1):50-79, 1994.
31. P. Flocchini, E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk. "Multiple mobile agent rendezvous in a ring". Proc. 6th Latin American Theoretical Informatics Symp. (LATIN), 599-608, 2004.
32. P. Flocchini, M.J. Huang, F.L. Luccio. "Contiguous search in the hypercube for capturing an intruder" Proc. 18th IEEE Int. Parallel and Distributed Processing Symp. (IPDPS), 2005.
33. P. Flocchini, M.J. Huang, F.L. Luccio. "Decontamination of chordal rings and tori". Proc. 8th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), 2006.
34. P. Flocchini, B. Mans, N. Santoro. "Sense of direction in distributed computing". Theoretical Computer Science, Vol. 291, 29-53, 2003.
35. P. Flocchini, A. Nayak, A. Shulz. "Cleaning an arbitrary regular network with mobile agents" Proc. of the 2nd Int. Conf. on Distributed Computing & Internet Technology (ICDCIT), 132-142, 2005.
36. N. Foukia, J. G. Hulaas, J. Harms. "Intrusion Detection with Mobile Agents". INET, www.isoc.org, 2001.
37. P. Fraigniaud, L. Gasieniec, D. Kowalski, A. Pelc. "Collective tree exploration". Networks, to appear.
38. P. Fraigniaud, D. Ilcinkas, "Digraph exploration with little memory". Proc. 21st Symp. on Theoretical Aspects of Computer Science (STACS), 246-257, 2004.
39. P. Fraigniaud, D. Ilcinkas, G. Peer, A. Pelc, D. Peleg. "Graph exploration by a finite automaton". Theoreti cal Computer Science, to appear.
40. P. Fraigniaud, N. Nisse. "Monotony Properties of Connected Visible Graph Searching". Proc. 32nd Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG)22-24, 2006.
41. F. Hohl. "Time limited blackbox security: Protecting mobile agents from malicious hosts". In Proc. of Conf on Mobile Agent Security, LNCS 1419, pages 92-113, 1998.
42. L. Kirousis, C. Papadimitriou. "Searching and pebbling". Theoreti cal Computer Science, 47(2):205-218, 1986.
43. R. Klasing, E. Markou, T. Radzik, F. Sarracco. "Approximation bounds for black hole search problems". Proc. 9th Int. Conf. on Principle of Distributed Systems (OPODIS), 2005.
44. R. Klasing, E. Markou, T. Radzik, F. Sarracco. "Hardness and approximation results for black hole search in arbitrary graphs". Proc. 12th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), 200-215, 2005.
45. E. Kranakis, D. Krizanc, N. Santoro, C. Sawchuk. "Mobile agent rendezvous in a ring". In Int. Conf. on Distibuted Computing Systems (ICDCS), 592-599, 2003.
46. E. Kranakis, D. Krizanc, S. Rajsbaum. "Mobile agent rendezvous". Proc. 13th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), 1-9, 2006.
47. A. Lapaugh. "Recontamination does not help to search a graph". Journal of the ACM 40(2), 224-245, 1993.
48. F. Luccio, L. Pagli, N. Santoro. "Network decontamination with local immunization". Proc. 8th Workshop on Advances in Parallel and Distributed Computational Models (APDCM), 2006.
49. N. Megiddo, S. Hakimi, M. Garey, D. Johnson, C. Papadimitriou. "The complexity of searching a graph". Journal of the ACM 35(1), 18-44, 1988.
50. R. Oppliger. "Security issues related to mobile code and agent-based systems". Computer Communications, 22(12):1165-1170, 1999.
51. P. Panaite, A. Pelc, "Exploring unknown undirected graphs". Journal of Algorithms, 33 281-295, 1999.
52. P. Panaite, A. Pelc. "Impact of topographic information on graph exploration efficiency". Networks, 36, 96-103, 2000.
53. T. Parson. "The search number of a connected graph". In the 9th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, 549-554, 1978.
54. T. Sander, C. F. Tschudin. "Protecting mobile agents against malicious hosts". In Proc. of Conf on Mobile Agent Security, LNCS 1419, pages 44-60, 1998.
55. E. H. Spafford, D. Zamboni. "Intrusion detection using autonomous agents". Computer Networks, 34(4):547-570, 2000.
56. J. Vitek, G. Castagna. "Mobile computations and hostile hosts". In D. Tsichritzis, editor, Mobile Objects, pages 241-261. University of Geneva, 1999.