Performance modeling of epidemic routing

被引:422
作者
Zhang, Xiaolan [1 ]
Neglia, Giovanni
Kurose, Jim
Towsley, Don
机构
[1] Univ Massachusetts, Dept Comp Sci, Amherst, MA 01003 USA
[2] Univ Palermo, I-90133 Palermo, Italy
基金
美国国家科学基金会;
关键词
delay tolerant networks; disruption tolerant networks; wireless ad hoc networks; epidemic routing; performance modeling; ordinary differential equations;
D O I
10.1016/j.comnet.2006.11.028
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we develop a rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and the number of copies made for a packet can be traded for faster delivery, illustrating the differences among various forwarding and recovery schemes considered. We perform model validations through simulation studies. Finally we consider the effect of buffer management by complementing the forwarding models with Markovian and fluid buffer models. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:2867 / 2891
页数:25
相关论文
共 31 条
[1]  
[Anonymous], 5372 INRIA
[2]  
Bailey N. T. J., 1975, The mathematical theory of infectious diseases and its applications, V2nd
[3]  
BETTSTETTER C, 2001, ACM SIGMOBILE COMPUT, V5
[4]  
Daley D., 1999, EPIDEMIC MODELLING
[5]  
DEMERS A, 1987, P 6 ACM S PRINC DIST
[6]  
Groenevelt R., 2005, ELSEVIER J PERFORMAN
[7]  
GUTRIN R, 1987, IEEE T VEH TECHNOL, V36, P89
[8]  
Haas Zygmunt J, 2006, IEEE ACM T NETWORKIN
[9]  
HANBALIL AA, 2006, 5860 INRIA
[10]  
Juang P., 2002, INT C ARCH SUPP PROG