Title :
A new network immunization strategy better than High Degree First
Author :
Niu, Changxi ; Li, Lemin ; Du Xu
Author_Institution :
Key Lab. of Broadband Opt. Fiber Transm. & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Abstract :
Epidemic attacks like worms and viruses are serious problems in Internet today. Designing effective network immunization strategy is an important way to defend against them. High Degree First (HDF) immunization strategy is the most effective strategy so far. In this paper, we propose a new network immunization strategy based on graph partitioning method. The strategy aims at partitioning the network so that the largest segment of the immunized network contains as less nodes as possible. Through extensive simulations on various network topologies, we find the new strategy is better than HDF strategy.
Keywords :
Internet; computer network security; graph theory; telecommunication network topology; Internet; epidemic attacks; graph partitioning method; high degree first immunization strategy; immunized network; network immunization strategy; network topology; Communication networks; Computer viruses; IP networks; Internet; Laboratories; Network topology; Optical fibers; Viruses (medical); epidemic; graph partitioning; high degree first; network immunization;
Conference_Titel :
Communications Technology and Applications, 2009. ICCTA '09. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-4816-6
Electronic_ISBN :
978-1-4244-4817-3
DOI :
10.1109/ICCOMTA.2009.5349084
