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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Burke, P.J.: The output of a queueing system. Oper. Res. 4(6), 699–704 (1956)
Carrasco, J.A.: Transient analysis of some rewarded markov models using randomization with quasistationarity detection. IEEE Trans. Comput. 53(9), 1106–1120 (2004)
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)
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)
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)
Simulating large networks using Fluid Flow Models (FFM). http://www-net.cs.umass.edu/fluid/ffm.html
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)
Gelenbe, E.: On approximate computer systems models. J. ACM 22(2), 261–263 (1975)
Gelenbe, E., Pujolle, G.: The behaviour of a single queue in a general queueing network. Acta Inf. 7(2), 123–136 (1976)
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)
Kleinrock, L.: Queueing Systems. Volume I: Theory. Wiley, New York (1975)
Kleinrock, L.: Queueing Systems. Volume II: Computer Applications. Wiley, New York (1976)
Liu, Y., Lo Presti, F., Misra, V., Gu, Y.: Fluid models and solutions for large-scale IP networks. In: ACM/SigMetrics (2003)
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)
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)
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
OMNET++ Community Site. http://www.omnetpp.org
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)
PRISM - probabilistic model checker. http://www.prismmodelchecker.org/
Stehfest, H.: Algorithm 368: numeric inversion of Laplace transform. Comm. ACM 13(1), 47–49 (1970)
Saad, Y.: Analysis of some Krylov subspace approximations to the matrix exponential operator. SIAM J. Numer. Anal. 29(1), 208 (1992)
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)
Sakumoto, Y., Ohsaki, H., Imase, M.: Accelerating flow-level network simulation with low-pass filtering of fluid models. In: SAINT 2012, Izmir (2012)
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)
Srikant, R.: The Mathemtics of Internet Congestion Control. Springer, Heidelberg (2004)
Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Chichester (1994)
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)
Weltzl, M.: Network Congestion Control: Managing Internet Traffic. Wiley, New York (2005)
Gu, Y., Liu, Y., Towsley, D.: On integrating fluid models with packet simulation. In: Proceedings of IEEE INFOCOM (2004)
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
Corresponding author
Editor information
Editors and Affiliations
Rights 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)