Traffic-driven SIR epidemic model on networks

Abstract

We propose a novel SIR epidemic model which is driven by the transmission of infection packets in networks. Specifically, infected nodes generate and deliver infection packets causing the spread of the epidemic, while recovered nodes block the delivery of infection packets, and this inhibits the epidemic spreading. The efficient routing protocol governed by a control parameter $\alpha$ is used in the packet transmission. We obtain the maximum instantaneous population of infected nodes, the maximum population of ever infected nodes, as well as the corresponding optimal $\alpha$ through simulation. We find that generally more balanced load distribution leads to more intense and wide spread of an epidemic in networks. Increasing either average node degree or homogeneity of degree distribution will facilitate epidemic spreading. When packet generation rate $\rho$ is small, increasing $\rho$ favors epidemic spreading. However, when $\rho$ is large enough, traffic congestion appears which inhibits epidemic spreading.

12 pages, 11 figures

References in corpus (8)

• Critical phenomena in complex networks
• Efficient routing on complex networks
• A message passing approach for general epidemic models
• Percolation and Epidemic Thresholds in Clustered Networks
• Traffic-driven Epidemic Spreading in Finite-size Scale-Free Networks
• Predicting the size and probability of epidemics in a population with heterogeneous infectiousness and susceptibility
• Suppressing traffic-driven epidemic spreading by edge-removal strategies
• Statistical mechanics of combinatorial auctions

Cited by in corpus (4)

• Suppressing traffic-driven epidemic spreading by adaptive routing strategy
• Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol
• Information transmission on hybrid networks
• Multiple predator based capture process on complex networks