Skip to main content
SpringerLink
Log in

Branching Processes, the Max-Plus Algebra and Network Calculus

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7314))

  • 813 Accesses

Abstract

Branching processes can describe the dynamics of various queueing systems, peer-to-peer systems, delay tolerant networks, etc. In this paper we study the basic stochastic recursion of multitype branching processes, but in two non-standard contexts. First, we consider this recursion in the max-plus algebra where branching corresponds to finding the maximal offspring of the current generation. Secondly, we consider network-calculus-type deterministic bounds as introduced by Cruz, which we extend to handle branching-type processes. The paper provides both qualitative and quantitative results and introduces various applications of (max-plus) branching processes in queueing theory.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Altman, E.: Semi-linear stochastic difference equations. Discrete Event Dynamic Systems 19, 115–136 (2008)

    Article  MathSciNet  Google Scholar 

  2. Altman, E., Foss, S., Riehl, E., Stidham, S.: Performance Bounds and Pathwise Stability for Generalized Vacation and Polling Systems. Operations Research 46(1), 137–148 (1998)

    Article  MATH  Google Scholar 

  3. Altman, E., Kofman, D.: Bounds for Performance Measures of Token Rings. IEEE/ACM Transactions on Networking 4(2), 292–299 (1996)

    Article  Google Scholar 

  4. Altman, E.: Stochastic recursive equations with applications to queues with dependent vacations. Annals of Operations Research 112(1), 43–61 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Altman, E.: On stochastic recursive equations and infinite server queues. In: Proceedings of IEEE Infocom, Miami, March 13-17 (2005)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.P.: Synchronization and Linearity. Wiley, Chichester (1992)

    MATH  Google Scholar 

  8. Borel, E.: Sur l’emploi du théorème de Bernoulli pour faciliter le calcul d’une infinité de coefficients. application au problème de lattente à un guichet. Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences 214, 452–456 (1942)

    MathSciNet  Google Scholar 

  9. Cohen, J.E., Kesten, H., Newman, C.M. (eds.): Random Matrices and Their Applications. Contemporary Mathematics, vol. 50. American Mathematical Society, Providence (1986)

    MATH  Google Scholar 

  10. Cruz, R.L.: A Calculus for Network Delay. Part I: Network Elements in Isolation and Part II: Network Analysis. IEEE Transactions on Information Theory 37(1), 114–141 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fiems, D., Altman, E.: Applying branching processes to delay-tolerant networks. In: Proceedings of the 4th International Conference on Bio-Inspired Models of Network, Information, and Computer Systems, Avignon. Lecture Notes of ICST, vol. 39, pp. 117–125 (December 2009)

    Google Scholar 

  12. Gaeta, R., Balbo, G., Bruell, S., Gribaudo, G., Sereno, M.: A simple analytical framework to analyze search strategies in large-scale peer-to-peer networks. Performance Evaluation 62(1-4), 1–16 (2005)

    Article  Google Scholar 

  13. Gaeta, R., Sereno, M.: Generalized probabilistic flooding in unstructured peer-to-peer networks. IEEE Transaction on Parallel and Distributed Systems 22(12), 2055–2062 (2011)

    Article  Google Scholar 

  14. Glasserman, P., Yao, D.D.: Stochastic vector difference equations with stationary coefficients. Journal of Applied Probability 32, 851–866 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Goldberg, M.A.: Numerical Solution of Integral Equations. Springer (1990)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Grishechkin, S.A.: Multiclass batch arrival retrial queues analyzed as branching processes with immigration. Queueing Systems 11, 395–418 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  18. Jiang, Y.: A basic stochastic network calculus. ACM SIGCOMM Computer Communication Review 36(4), 123–134 (2006)

    Article  Google Scholar 

  19. Kendall, D.G.: Some problems in the theory of queues. Journal of the Royal Statistical Society Series B-Methodological 13, 151–185 (1951)

    MathSciNet  MATH  Google Scholar 

  20. Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  21. Leskela, L., Robert, P., Simatos, F.: Interacting branching processes and linear file-sharing networks. Advances in Applied Probability 42(3), 834–854 (2010)

    Article  MathSciNet  Google Scholar 

  22. Peeters, G.T., Van Houdt, B.: On the Maximum Stable Throughput of Tree Algorithms With Free Access. IEEE Transactions on Information Theory 55(11), 5087–5099 (2009)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Maestro group, INRIA, 2004 Route des Lucioles, 06902, Sophia Antipolis Cedex, France

    Eitan Altman

  2. Department TELIN, Ghent University, St-Pietersnieuwstraat 41, 9000, Gent, Belgium

    Dieter Fiems

Authors
  1. Eitan Altman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dieter Fiems
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Advanced Technology, University of Glamorgan, Pontypridd, UK

    Khalid Al-Begain

  2. Department of Telecommunications and Information Processing, Ghent University, St-Pietersnieuwstraat 41, B-9000, Belgium

    Dieter Fiems

  3. LIG Laboratory - INRIA MESCAL Project,, Joseph Fourier University, 51, avenue Jean Kuntzmann, F-38330, Montbonnot, France

    Jean-Marc Vincent

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Altman, E., Fiems, D. (2012). Branching Processes, the Max-Plus Algebra and Network Calculus. In: Al-Begain, K., Fiems, D., Vincent, JM. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2012. Lecture Notes in Computer Science, vol 7314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30782-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30782-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30781-2

  • Online ISBN: 978-3-642-30782-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation