Modelling epidemic routing with heterogeneous infection rate. (2017)

• Record Type: Journal Article
• Authors: Yuan, Peiyan; Liu, Shangwang; Zhang, En
• Is Part Of: International journal of high performance computing and networking. Volume 10:Number 3(2017)
• Page Start: 218
• Page End: 225
• Publication Date: 2017
• Subjects: epidemic routing -- scaling law -- contact rate -- infection rate; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

Abstract

The epidemic routing has been integrated into many applications, ranging from the worm propagation of online social networks to the message diffusion in offline physical systems. Modelling epidemic routing provides a baseline to evaluate system performance; it also becomes very desirable for engineers to have theoretical guidance before they deploy the real system. Early works analyse the dynamics of epidemic routing with the average contact rate, i.e., each node will encounter the same number of other nodes in a time slot. They neglect the status of encountered nodes (i.e., infected or susceptible), resulting in the defectiveness of existing models. In this paper, we observe that the infectivity of nodes has heterogeneity rather than homogeneity, two nodes with the same contact rate may behave different infectivities. Motivated by this observation, we first use infection rate to reflect the infectivity of infected nodes. We then model the epidemic routing with the average infection rate, instead of the contact rate. We finally compare our model with the existing works through theoretical analysis and simulations. The results show that our model has a closer match than those of the state-of-the-art works, which provides an upper bound on the number of infected nodes.