Abstract
In this paper we investigate the problem of decontaminating a network from the presence of a black virus (BV), a harmful entity capable both of destroying any agent arriving at the site where it resides, and of moving to all the neighbouring sites. This problem integrates in its definition both the harmful aspects of the classical static black hole search problem with the mobility aspects of the classical intruder capture or network decontamination problem. The initial location of the BV is unknown; the critical objective for a team of system agents is to locate and eliminate the BV with the minimum number of network infections and agent casualties. The decontamination process is clearly dangerous for the system agents and for the nodes infected by the spreading of the BV. The problem of black virus decontamination (BVD) has been investigated only for special classes of highly regular network topologies.
In this paper, we consider the BVD problem and show how to solve it in networks of arbitrary topology. The solution protocol is provably correct, deterministic, generic (i.e., works irrespective of the network topology), and worst-case optimal. In fact, we prove that our protocol always correctly decontaminates the network with the minimum number of system agents’ casualties and network infections. Furthermore, we show that the total number of system agents is asymptotically optimal.
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.
Similar content being viewed by others
References
Barrière, L., Flocchini, P., Fraignaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: 14th Symposium on Parallel Algorithms and Architectures (SPAA), pp. 200–209 (2002)
Blin, L., Fraignaud, P., Nisse, N., Vial, S.: Distributed chasing of network intruders. Theoretical Computer Science 399(1-2), 12–37 (2008)
Cai, J., Flocchini, P., Santoro, N.: Decontaminating a network from a black virus. International Journal of Networking and Computing 63(2), 397–410 (2014)
Chalopin, J., Das, S., Labourel, A., Markou, E.: Black hole search with finite automata scattered in a synchronous torus. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 432–446. Springer, Heidelberg (2011)
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)
Czyzowicz, J., Dobrev, S., Královič, 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 (2010)
Dobrev, S., Flocchini, P., Královic, R., Ruzicka, P., Prencipe, G., Santoro, N.: Black hole search in common networks. Networks 47(2), 61–71 (2006)
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)
Dobrev, S., Flocchini, P., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48, 67–90 (2007)
Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of hypercubes by mobile agents. Networks 52(3), 167–178 (2008)
Flocchini, P., Huang, M.J., Luccio, F.L.: Decontaminating chordal rings and tori using mobile agents. International Journal on Foundations of Computer Science 18(3), 547–563 (2006)
Flocchini, P., Luccio, F.L., Song, L.X.: Size optimal strategies for capturing an intruder in mesh networks. In: International Conference on Communications in Computing (CIC), pp. 200–206 (2005)
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 (2012)
Fomin, F.V., Thilikos, D.M., Todineau, I.: Connected graph searching in outerplanar graphs. In: 7th International Conference on Graph Theory, ICGT (2005)
Glaus, P.: Locating a black hole without the knowledge of incoming link. In: 5th Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSOR), pp. 128–138 (2009)
Imani, N., Sarbazi-Azadb, H., Zomaya, A.Y.: Capturing an intruder in product networks. Journal of Parallel and Distributed Computing 67(9), 1018–1028 (2007)
Imani, N., Sarbazi-Azad, H., Zomaya, A.Y., Moinzadeh, P.: Detecting threats in star graphs. IEEE Trans. Par. and Dist. Systems 20(4), 474–483 (2009)
Klasing, R., Markou, E., Radzik, T., Sarracco, F.: Approximation bounds for black hole search problems. Networks 52(4), 216–226 (2008)
Luccio, F., Pagli, L.: A general approach to toroidal mesh decontamination with local immunity. In: 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1–8 (2009)
Luccio, F., Pagli, L., Santoro, N.: Network decontamination in presence of local immunity. Int. J. Foundation of Computer Science 18(3), 457–474 (2007)
Luccio Contiguous, F.L.: search problem in Sierpinski graphs. Theory of Computing Systems 44(2), 186–204 (2009)
Nisse, N.: Connected graph searching in chordal graphs. Discrete Applied Mathematics 157(12), 2603–2610 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Cai, J., Flocchini, P., Santoro, N. (2015). Black Virus Decontamination in Arbitrary Networks. In: Rocha, A., Correia, A., Costanzo, S., Reis, L. (eds) New Contributions in Information Systems and Technologies. Advances in Intelligent Systems and Computing, vol 353. Springer, Cham. https://doi.org/10.1007/978-3-319-16486-1_98
Download citation
DOI: https://doi.org/10.1007/978-3-319-16486-1_98
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16485-4
Online ISBN: 978-3-319-16486-1
eBook Packages: Computer ScienceComputer Science (R0)