Abstract
Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team of agents is deployed to decontaminate the whole network. In the vast literature a variety of assumptions are made on the power of the agents, which can typically communicate, exchange information, remember the past, etc.
In this paper we consider the problem in a much weaker setting; in fact we wish to describe the global disinfection process by a set of cellular automata local rules without the use of active agents. We consider the grid, which is naturally described by a 2-dimensional cellular automata, and we devise disinfection rules both in the common situation where after being disinfected a cell is prone to re-contamination by contact, and in a new setting where disinfection leaves the cells immune to recontamination for a certain amount of time (temporal immunity). We also distinguish between Von Neuman and Moore neighborhood, showing that, not surprisingly, a bigger neighborhood allows for a more efficient disinfection.
This work was partially supported by NSERC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barrière, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. 14th Symp. Parallel Algorithms and Architectures (SPAA 2002), pp. 200–209 (2002)
Bienstock, D., Seymour, P.: Monotonicity in graph searching. J. Algorithms 12, 239–245 (1991)
Flocchini, P.: Contamination and decontamination in majority-based systems. Journal of Cellular Automata 4(3), 183–200 (2009)
Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of hypercubes by mobile agents. Networks 52(3), 167–178 (2008)
Flocchini, P., Luccio, F.L., Song, L.X.: Size Optimal Strategies for Capturing an Intruder in Mesh Networks. Communications in Computing, 200–206 (2005)
Flocchini, P., Mans, B., Santoro, N.: Tree decontamination with temporary immunity. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 330–341. Springer, Heidelberg (2008)
Fomin, F., Golovach, P.: Graph searching and interval completion. SIAM J. on Discrete Mathematics 13(4), 454–464 (2000)
Fraigniaud, P., Nisse, N.: Connected treewidth and connected graph searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 479–490. Springer, Heidelberg (2006)
Qiu, J.: Best Effort Decontamination of Networks. Ms. Thesis, U. of Ottawa (2007)
Ilcinkas, D., Nisse, N., Soguet, D.: The cost of monotonicity in distributed graph searching. Distributed Computing 22(2), 117–127 (2009)
Luccio, F., Pagli, L., Santoro, N.: Network decontamination with local immunization. International Journal of Foundation of Computer Science 18(3), 457–474 (2007)
Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of the ACM 35(1), 18–44 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daadaa, Y., Flocchini, P., Zaguia, N. (2010). Network Decontamination with Temporal Immunity by Cellular Automata. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-15979-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15978-7
Online ISBN: 978-3-642-15979-4
eBook Packages: Computer ScienceComputer Science (R0)