Abstract
In this paper we consider a tandem queueing system consisting of a finite number of multi-server queues (stations) without buffers. Customers arrive to the first station in the MAP (Markovian Arrival Process). The service times at the servers of the tandem are exponentially distributed with different parameters for different stations. We describe the output flows from the stations of the tandem as MAPs and present the simple method for recursive constructing the infinitesimal generator of the multi-dimensional Markov chain describing the operation of the system, calculating the stationary distributions and loss probabilities associated with the tandem. It is shown that the marginal stationary distribution of any station can be calculated as stationary distribution of the system of MAP/M/N/N type.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balsamo, S., Persone, V.D.N., Inverardi, P.: A review on queueing network models with finite capacity queues for software architectures performance prediction. Performance Evaluation 51, 269–288 (2003)
Gnedenko, B.W., Konig, D.: Handbuch der Bedienungstheorie. Akademie Verlag, Berlin (1983)
Perros, H.G.: A bibliography of papers on queueing networks with finite capacity queues. Performance Evaluation 10, 255–260 (1989)
Heyman, D.P., Lucantoni, D.: Modelling multiple IP traffic streams with rate limits. IEEE/ACM Transactions on Networking 11, 948–958 (2003)
Klemm, A., Lindermann, C., Lohmann, M.: Modelling IP traffic using the batch Markovian arrival process. Performance Evaluation 54, 149–173 (2003)
Bromberg, M.A.: Multi-phase systems with losses with exponential servicing. Automation and Remote Control 40, 27–31 (1979)
Bromberg, M.A., Kokotushkin, V.A., Naumov, V.A.: Service by a cascaded network of instruments. Automation and Remote Control 38, 60–64 (1977)
Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Communications in Statistics-Stochastic Models 7, 1–46 (1991)
Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Chichester (1981)
Klimenok, V.I.: Calculation of characteristics of a multiserver queue with rejections and burst-like traffic. Automatic Control and Computer Sciences 33(6), 35–43 (1999)
Klimenok, V., Kim, C.S., Orlovsky, D., Dudin, A.: Lack of invariant property of Erlang loss model in case of the MAP input. Queueing Systems 49, 187–213 (2005)
Skorokhod, A.: Probability theory and random processes. High School, Kiev (1980)
Alfa, A.S., Diamond, J.E.: On approximating higher order MAPs with MAPs of order two. Queueing Systems 34, 269–288 (2000)
Heindl, A., Mitchell, K., van de Liefvoort, A.: Correlation bounds for second order MAPs with application to queueing network decomposition. Performance Evaluation 63, 553–577 (2006)
Heindl, A., Telek, M.: Output models of MAP/PH/1(/K) queues for an efficient network decomposition. Performance Evaluation 49, 321–339 (2002)
Neuts, M.: Matrix-geometric Solutions in Stochastic Models – An Algorithmic Approach. Johns Hopkins University Press, USA (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klimenok, V., Dudin, A., Vishnevsky, V. (2012). On the Stationary Distribution of Tandem Queue Consisting of a Finite Number of Stations. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2012. Communications in Computer and Information Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31217-5_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-31217-5_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31216-8
Online ISBN: 978-3-642-31217-5
eBook Packages: Computer ScienceComputer Science (R0)