2015/02/28 by Han-Xin Yang, Zhen Wang, Zhi-Xi Wu · 1 citation
Computer Science · Physics and Astronomy · #cs.SI #physics.soc-ph
paper · pdf · doi:10.1016/j.chaos.2016.10.012
published as Chaos, Solitons and Fractals 93 (2016) 147-150 · 4 pages, 7 figures. arXiv admin note: substantial text overlap with arXiv:1503.00145
arxiv created 2018/02/05 · arxiv updated 2018/02/14
The design of routing strategies for traffic-driven epidemic spreading has received increasing attention in recent years. In this paper, we propose an adaptive routing strategy that incorporates topological distance with local epidemic information through a tunable parameter h. In the case where the traffic is free of congestion, there exists an optimal value of routing parameter h, leading to the maximal epidemic threshold. This means that epidemic spreading can be more effectively controlled by adaptive routing, compared to that of the static shortest path routing scheme. Besides, we find that the optimal value of h can greatly relieve the traffic congestion in the case of finite node-delivering capacity. We expect our work to provide new insights into the effects of dynamic routings on traffic-driven epidemic spreading.