Skip to main content

Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues

  • Conference paper
Distributed Computer and Communication Networks (DCCN 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 279))

  • 632 Accesses

Abstract

The article summarises author’s experience in two problems related to the use of queueing models in performance evaluation of computer networks: modelling transient states of queues and computations for queueing network models having large number of nodes. Both issues are not well represented in classical queueing theory, yet important to applications, because the observed traffic is time dependant and network topologies that should be considered become larger and larger. The article discusses two approaches: diffusion approximation and fluid-flow approximation that can cope with much larger models that are attainable with the use of Markov chains.

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

Access this chapter

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 EPUB and 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

References

  1. Burke, P.J.: The output of a queueing system. Oper. Res. 4(6), 699–704 (1956)

    Article  Google Scholar 

  2. Carrasco, J.A.: Transient analysis of some rewarded markov models using randomization with quasistationarity detection. IEEE Trans. Comput. 53(9), 1106–1120 (2004)

    Article  Google Scholar 

  3. Czachórski, T.: A method to solve diffusion equation with instantaneous return processes acting as boundary conditions. Bull. Pol. Acad. Sci. Tech. Sci. 41(4) (1993)

    Google Scholar 

  4. Czachórski, T., Grochla, K., Pekergin, F.: Stability and dynamics of TCP-NCR(DCR) protocol in presence of UDP flows. In: García-Vidal, J., Cerdà-Alabern, L. (eds.) Euro-NGI 2007. LNCS, vol. 4396, pp. 241–254. Springer, Heidelberg (2007)

    Google Scholar 

  5. Czachórski, T., Pekergin, F.: Diffusion approximation as a modelling tool. In: Kouvatsos, D.D. (ed.) Next Generation Internet: Performance Evaluation and Applications. LNCS, vol. 5233, pp. 447–476. Springer, Heidelberg (2011)

    Google Scholar 

  6. Simulating large networks using Fluid Flow Models (FFM). http://www-net.cs.umass.edu/fluid/ffm.html

  7. FSIM. http://www.ispl.jp/oosaki/software/fsim

  8. Genin, D., Marbukh, V.: Bursty fluid approximation of TCP for modeling internet congestion at the flow level. In: Allerton’09: Proceedings of the 47th annual Allerton Conference on Communication, Control, and Computing, IEEE Press (2009)

    Google Scholar 

  9. Gelenbe, E.: On approximate computer systems models. J. ACM 22(2), 261–263 (1975)

    Article  MathSciNet  Google Scholar 

  10. Gelenbe, E., Pujolle, G.: The behaviour of a single queue in a general queueing network. Acta Inf. 7(2), 123–136 (1976)

    Article  MathSciNet  Google Scholar 

  11. Hollot, K., Liu, Y., Misra, V., Towsley, D., Gong, W.B.: Fluid methods for modeling large heterogeneous networks. Technical report AFRL-IF-RS-TR-2005-282 (2005)

    Google Scholar 

  12. Kleinrock, L.: Queueing Systems. Volume I: Theory. Wiley, New York (1975)

    MATH  Google Scholar 

  13. Kleinrock, L.: Queueing Systems. Volume II: Computer Applications. Wiley, New York (1976)

    MATH  Google Scholar 

  14. Liu, Y., Lo Presti, F., Misra, V., Gu, Y.: Fluid models and solutions for large-scale IP networks. In: ACM/SigMetrics (2003)

    Google Scholar 

  15. Liu, J.: Packet-level integration of fluid TCP models in real-time network simulation. In: Proceedings of the 38th Conference on Winter Simulation, Monterey, California, 03–06 December , pp. 2162 - 2169 (2006)

    Google Scholar 

  16. Misra, V., Gong, W., Towsley, D.: A fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED. In: Proceedings of the Conference on Applications, Technologies, Architectures and Protocols for Computer Communication (SIGCOMM 2000), pp. 151–160 (2000)

    Google Scholar 

  17. Numerical computation for Markov chains on GPU: building chains and bounds, algorithms and applications. Project POLONIUM 2012–2013, bilateral cooperation PRISM-Université de Versailles and IITiS PAN, Polish Academy of Sciences

    Google Scholar 

  18. OMNET++ Community Site. http://www.omnetpp.org

  19. Pecka, P., Deorowicz, S., Nowak, M.: Efficient representation of transition matrix in the Markov process modeling of computer networks. In: Czachórski, T., Kozielski, S., Stańczyk, U. (eds.) Man-Machine Interactions 2. AISC, vol. 103, pp. 457–464. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. PEPS. http://www-id.imag.fr/Logiciels/peps/userguide.html

  21. PRISM - probabilistic model checker. http://www.prismmodelchecker.org/

  22. Stehfest, H.: Algorithm 368: numeric inversion of Laplace transform. Comm. ACM 13(1), 47–49 (1970)

    Article  Google Scholar 

  23. Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29(1), 208 (1992)

    Article  MathSciNet  Google Scholar 

  24. Sakumoto, Y., Asai, R., Ohsaki, H., Imase, M.: Design and implementation of flow-level simulator for performance evaluation of large scale networks. In: 15th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) (2007)

    Google Scholar 

  25. Sakumoto, Y., Ohsaki, H., Imase, M.: Accelerating flow-level network simulation with low-pass filtering of fluid models. In: SAINT 2012, Izmir (2012)

    Google Scholar 

  26. Scientifique, C., Philippe, B., Sidje, R.B.: Transient solutions of Markov processes by Krylov subspaces. In: 2nd International Workshop on the Numerical Solution of Markov Chains (1989)

    Google Scholar 

  27. Srikant, R.: The Mathemtics of Internet Congestion Control. Springer, Heidelberg (2004)

    Book  Google Scholar 

  28. Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Chichester (1994)

    MATH  Google Scholar 

  29. Tomasik, J., Weisser, M.A.: Internet topology on AS-level: model, generation methods and tool. In: 29th IEEE International Performance Computing and Communications Conference IPCCC 2010 (2010)

    Google Scholar 

  30. Weltzl, M.: Network Congestion Control: Managing Internet Traffic. Wiley, New York (2005)

    Book  Google Scholar 

  31. Gu, Y., Liu, Y., Towsley, D.: On integrating fluid models with packet simulation. In: Proceedings of IEEE INFOCOM (2004)

    Google Scholar 

Download references

Acknowledgments

This work was supported by Polish project NCN nr 4796/B/T02/2011/40 “Models for transmissions dynamics, congestion control and quality of service in Internet” and the European Union from the European Social Fund (grant agreement number: UDA-POKL.04.01.01-00-106/09).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tadeusz Czachórski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Czachórski, T., Nycz, M., Nycz, T. (2014). Modelling Transient States in Queueing Models of Computer Networks: A Few Practical Issues. In: Vishnevsky, V., Kozyrev, D., Larionov, A. (eds) Distributed Computer and Communication Networks. DCCN 2013. Communications in Computer and Information Science, vol 279. Springer, Cham. https://doi.org/10.1007/978-3-319-05209-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05209-0_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05208-3

  • Online ISBN: 978-3-319-05209-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics