Performance Modeling of Epidemic Routing

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 power can be traded for faster delivery, illustrating the differences among the various epidemic schemes considered. Finally we consider the effect of buffer management by complementing the forwarding models with Markovian and fluid buffer models.

[1]  Alun L Lloyd,et al.  Estimating variability in models for recurrent epidemics: assessing the use of moment closure techniques. , 2004, Theoretical population biology.

[2]  Jeffrey O. Kephart,et al.  Measuring and modeling computer virus prevalence , 1993, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy.

[3]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[4]  Brian D. Noble,et al.  Modeling epidemic spreading in mobile environments , 2005, WiSe '05.

[5]  M J Keeling,et al.  Multiplicative moments and measures of persistence in ecology. , 2000, Journal of theoretical biology.

[6]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[7]  Jeffrey O. Kephart,et al.  Directed-graph epidemiological models of computer viruses , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[8]  Zygmunt J. Haas,et al.  A new networking model for biological applications of ad hoc sensor networks , 2006, TNET.

[9]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[10]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[11]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[12]  Giovanni Neglia,et al.  Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study , 2006, CHANTS '06.

[13]  Henning Schulzrinne,et al.  Seven degrees of separation in mobile ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[14]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[15]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

[16]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Norman T. J. Bailey,et al.  The Mathematical Theory of Infectious Diseases , 1975 .

[18]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[19]  Ingemar Nåsell,et al.  An extension of the moment closure method. , 2003, Theoretical population biology.

[20]  D. Wood.  The Computation of Polylogarithms , 1992 .

[21]  Eitan Altman,et al.  Performance Evaluation of Packet Relaying in Ad Hoc Networks , 2006 .

[22]  R.A. Guerin,et al.  Channel occupancy time distribution in a cellular radio system , 1987, IEEE Transactions on Vehicular Technology.

[23]  Ger Koole,et al.  Message delay in MANET , 2005, SIGMETRICS '05.

[24]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[25]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[26]  Vern Paxson,et al.  How to Own the Internet in Your Spare Time , 2002, USENIX Security Symposium.

[27]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[28]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

[29]  T. Kurtz.  Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[30]  Christian Bettstetter,et al.  Mobility modeling in wireless networks: categorization, smooth movement, and border effects , 2001, MOCO.

[31]  Donald F. Towsley,et al.  On the performance of Internet worm scanning strategies , 2006, Perform. Evaluation.