Immunization of Real Complex Communication Networks

Abstract

Most communication networks are complex. In this paper, we address one of the fundamental problems we are facing nowadays, namely, how we can efficiently protect these networks. To this end, we study an immunization strategy and found that it works as good as targeted immunization, but using only local information about the network topology. Our findings are supported with numerical simulations of the Susceptible-Infected-Removed (SIR) model on top of real communication networks, where immune nodes are previously identified by a covering algorithm. The results provide useful hints in the way to design and deploying a digital immune system.

6 pages. To appear in the European Physical Journal B (2006)

References in corpus (17)

• Emergence of scaling in random networks
• The structure and function of complex networks
• Epidemic spreading in scale-free networks
• Evolution of networks
• Resilience of the Internet to random breakdowns
• Mean-field theory for scale-free random networks
• Epidemic dynamics and endemic states in complex networks
• Dynamical and correlation properties of the Internet
• Immunization of complex networks
• Efficient Immunization Strategies for Computer Networks and Populations
• Large-scale topological and dynamical properties of Internet
• Halting viruses in scale-free networks
• Absence of epidemic threshold in scale-free networks with connectivity correlations
• Resilience to damage of graphs with degree correlations
• Epidemic Incidence in Correlated Complex Networks
• Computational complexity arising from degree correlations in networks
• Distance-d covering problems in scale-free networks with degree correlations

Cited by in corpus (26)

• Epidemic processes in complex networks
• Statistical physics of vaccination
• Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications
• Epidemic spreading on complex networks with general degree and weight distributions
• Effective approach to epidemic containment using link equations in complex networks
• Global efficiency of local immunization on complex networks
• Disease spreading in populations of moving agents
• The Evolutionary Vaccination Dilemma in Complex Networks
• The effect of the forget-remember mechanism on spreading
• A dynamic model of time-dependent complex networks
• Message passing for vertex covers
• Optimal Allocation of Resources for Suppressing Epidemic Spreading on Networks
• Local Empathy provides Global Minimization of Congestion in Communication Networks
• The robustness of interdependent networks under the interplay between cascading failures and virus propagation
• Non massive immunization to contain spreading on complex networks
• Stability analysis on the finite-temperature replica-symmetric and first-step replica-symmetry-broken cavity solutions of the random vertex cover problem
• Dynamical Immunization Strategy for Seasonal Epidemics
• Bifurcation analysis of the Microscopic Markov Chain Approach to contact-based epidemic spreading in networks
• Statistical physics of hard combinatorial optimization: The vertex cover problem
• Determining the Solution Space of Vertex-Cover by Interactions and Backbones
• Research on Solution Space of Bipartite Graph Vertex-Cover by Maximum Matchings
• Heterogeneous Recovery Rates against SIS Epidemics in Directed Networks
• Organization mechanism and counting algorithm on Vertex-Cover solutions
• Core Influence Mechanism on Vertex-Cover Problem through Leaf-Removal-Core Breaking
• Statistical mechanics of the minimum vertex cover problem in stochastic block models
• Diseases on complex networks. Modeling from a database and a protection strategy proposal