Mobile search for a black hole in an anonymous ring

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

Volumn 2180, Issue , 2001, Pages 166-179

  Dobrev, Stefan ^a   Flocchini, Paola ^b   Prencipe, Giuseppe ^c   Santoro, Nicola ^d  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

^b UNIVERSITY OF OTTAWA   (Canada)

^c UNIVERSITY OF PISA   (Italy)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

Distributed computing; Hazardous search; Mobile agents; Ring network

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GRAVITATION; STARS;

A-RINGS; BLACK HOLES; HAZARDOUS SEARCH; MOBILE SEARCH; PRIORI KNOWLEDGE; RING NETWORKS; STATIONARY PROCESS;

MOBILE AGENTS;

EID: 84957010128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_12     Document Type: Conference Paper

References (18)

1. L. Barrière, P. Flo cchini, P.F raigniaud, and N. Santoro. Gathering of mobile agents with incomparable labels. Tech.Rep.ECHO-01, Center for e-Computing, 2001.
2. M.A. Bender and D. Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs.In FOCS’94, pages 75–85, 1994.
3. B. Brewington, R. Gray, and K. Moizumi. Mobile agents in distributed information retieval. Intelligent Information Agents, pages 355–395, 1999.
4. W. Chen, C. Leng, and Y. Lien. A novel mobile agent search algorithm. Information Sciences, 122(2-4):227–240, 2000.
5. K. Diks, A. Malinowski, and A. Pelc. Reliable token dispersal with random faults. Parallel Processing Letters, 4:417–427, 1994.
6. K. Diks, A. Malinowski, and A. Pelc. Token transfer in a faulty network. Theoretical Informatics and Applications, 29:383–400, 1995.
7. K. Diks and A. Pelc. Fault-tolerant linear broadcasting. Nordic Journal of Computing, 3:188–201, 1996.
8. S. Dobrev, P. Flocchini, G. Prencipe, and N. Santoro. Finding a black hole in an arbitrary network. Tech.Rep. ECHO-03, Center for e-Computing, 2001.
9. O. Goldreich and L. Shrira. Electing a leader in a ring with link failures. Acta Informatica, 24:79–91, 1987.
10. O. Goldreich and L. Shrira. On the complexity of computation in the presence of link failures: The case of a ring. Distr. Computing, 5:121–131, 1991.
11. J. Hammer and J. Fiedler. Using mobile crawlers to search the web efficiently. International Journal of Computer and Information Systems. To appear.
12. F. Hohl. A framework to protect mobile agents by using reference states.In ICDCS 2000, 2000.
13. N.R. Jennings. On agent-based software engineering. Art. Intelligence, 117(2):277–296, 2000.
14. L.M. Kirousis, E. Kranakis, D. Krizanc, and Y.C. Stamatiou. Locating information with uncertainty in fully interconnected networks.In DISC’00, pages 283–296, 2000.
15. K. Moizumi and G. Cybenko. The travelling agent problem. Mathematics of Control, Signal and Systems, 1998.
16. D. Rus, R. Gray, and D. Kotz. Autonomous and adaptive agents that gather information. In AAAI’96, pages 107–116, 1996.
17. T. Sander and C.F. Tschudin. Protecting mobile agents against malicious hosts. In Mobile Agents and Security, LNCS 1419, pages 44–60, 1998.
18. K.Sc helderup and J.Ines. Mobile agent security - issues and directions. In 6th Int. Conf. On Intell. And Services in Networks, LNCS 1597, pages 155–167, 1999.