Skip to main content
Springer Nature Link
Log in

Applying Branching Processes to Delay-Tolerant Networks

  • Conference paper
Bioinspired Models of Network, Information, and Computing Systems (BIONETICS 2009)

  • 317 Accesses

Abstract

Mobility models that have been used in the past to study delay tolerant networks (DTNs) have been either too complex to allow for deriving analytical expressions for performance measures, or have been too simplistic. In this paper we identify several classes of DTNs where the dynamics of the number of nodes that have a copy of some packet can be modeled as branching process with migration. Using recent results on such processes in a random environment, we obtain explicit formulae for the first two moments of the number of copies of a file that is propagated in the DTN, for quite general mobility models. Numerical examples illustrate our approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Adke, S.R., Gadag, V.G.: A new class of branching processes. In: Heyde, C.C. (ed.) Branching Processes: Proceedings of the First World Congress. Springer Lecture Notes, vol. 99, pp. 1–13 (1995)

    Google Scholar 

  2. Albertsen, K.: The Extinction of Families. International Statistical Review/Revue Internationale de Statistique 63(2), 234–239 (1995)

    Google Scholar 

  3. Altman, E.: Competition and cooperation between nodes in Delay Tolerant Networks with Two Hop Routing. In: Proceedings of Netcoop 2009, Eindhoven, The Netherlands (November 2009)

    Google Scholar 

  4. Altman, E., Fiems, D.: Expected waiting time in polling systems with correlated vacations. Queueing Systems 56(3-4), 241–253 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Athreya, K., Vidyashankar, A.: Branching Processes. In: Maddala, G., Rao, C., Vinod, H. (eds.) Handbook of Statistics, ch. 2, vol. 19. Elsevier Science B.V., Amsterdam (2001)

    Google Scholar 

  6. Bienaymé, I.J.: De la loi de la multiplication et de la durée des familles. Soc. Philomath., Paris Extraits Ser. 5, 37–39 (1845)

    Google Scholar 

  7. Bertoin, J.: Lévy Processes. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  8. Cerf, V., et al.: Delay-tolerant network architecture. IETF RFC 4838

    Google Scholar 

  9. D’Auria, B.: M/M/∞ queues in semi-markovian random environment. Queueing Systems 58(3), 221–237 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Eliazar, I.: On the discrete-time G/GI/ ∞ queue. Technical report, Holon Institute of Technology (2006)

    Google Scholar 

  11. Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of SIGCOMM 2003, pp. 27–34 (2003)

    Google Scholar 

  12. Falin, G.: The M/M/∞ queue in a random environment. Queueing Systems 58(1), 65–76 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fiems, D., Altman, E.: Markov-modulated stochastic recursive equations with applications to delay-tolerant networks. INRIA Research Report No. 6872 (2009); Submitted to Performance Evaluation

    Google Scholar 

  14. Galton, F.: Problem 4001. Educational Times April 1 (17) (1873)

    Google Scholar 

  15. Galton, F., Watson, H.W.: On the probability of the extinction of the families. J. Royal Antropol. Soc., London 4, 138–144 (1874)

    Google Scholar 

  16. Garetto, M., Giaccone, P., Leonardi, E.: On the effectiveness of the 2-hop routing strategy in mobile ad hoc networks. In: Proceedings of ICC 2007 (2007)

    Google Scholar 

  17. Grishechkin, S.A.: On a relation between processor sharing queues and Crump-Mode-Jagers branching processes. Advances in Applied Probability 24, 653–698 (1992)

    MathSciNet  MATH  Google Scholar 

  18. Helgason, O., Karlsson, G.: On the effect of cooperation in wireless content distribution. In: Proceedings of WONS 2008 (2008)

    Google Scholar 

  19. Heyde, C.C., Senneta, E.: Studies in the History of Probability and Statistics. XXXI. The simple branching process, a turning point test and a fundamental inequality: A historical note on I. J. Bienaymé, Biometrika 59(3), 680–683 (1972)

    MathSciNet  MATH  Google Scholar 

  20. Key, E.: Limiting distributions and regeneration times for multitype branching processes with immigration in a random environment. Annals of Probability 15, 344–353 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lambert, A.: The genealogy of continuous-state branching processes with immigration. Journal of Probability Theory and Related Fields 122(1), 42–70 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  22. Le Gall, J.F.: Random trees and spatial branching processes. Maphysto Lecture Notes Series (Univ of Aarhus), vol. 9 (2000)

    Google Scholar 

  23. McNamara, J., Houston, A., Collins, E.: Optimality models in behavioral biology. SIAM Review 43(3), 413–466 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Núñez Queija, R.: Processor-Sharing Models for Integrated-Services Networks. PhD thesis, Eindhoven University of Technology (2000)

    Google Scholar 

  25. Resing, J.: Polling systems and multi-type branching processes. Queueing Systems 13, 409–426 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  26. Roitershtein, A.: A note on multitype branching processes with immigration in a random environment. Annals of Probability 35(4), 1573–1592 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  27. Watson, H.W.: Solution to problem 4001. Educational Times August 1, 115–116 (1873)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SMACS Research Group, Department TELIN, Ghent University, Belgium

    Dieter Fiems

  2. INRIA, BP93, 06902, Sophia Antipolis, France

    Eitan Altman

Authors
  1. Dieter Fiems
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eitan Altman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA, 2004 Route des Lucioles, B.P. 93, 06902, Sophia Antipolis Cedex, France

    Eitan Altman

  2. CREATE-NET, vial alla Cascata 56D, 38123, Trento, Provo, Italy

    Iacopo Carrera

  3. LIA, University of Avignon, 339 chemin des Meinajariès, 84911, Avignon Cedex 9, France

    Rachid El-Azouzi  & Yezekael Hayel  & 

  4. School of Computing, Napier University, Merchiston Campus, 10 Colinton Road, EH10 5DT, Edinburgh, Scotland

    Emma Hart

Rights and permissions

Reprints and permissions

Copyright information

© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Fiems, D., Altman, E. (2010). Applying Branching Processes to Delay-Tolerant Networks. In: Altman, E., Carrera, I., El-Azouzi, R., Hart, E., Hayel, Y. (eds) Bioinspired Models of Network, Information, and Computing Systems. BIONETICS 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 39. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12808-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12808-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12807-3

  • Online ISBN: 978-3-642-12808-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics