Abstract
A dual tandem consisting of multi-server queueing systems without buffers is considered. Customers of two types arrive to Station 1 in the MMAP (Marked Markovian Arrival Process). The first type customers aim to be served at Station 1 only while the second type customers should be served at both stations. The stationary distribution of the system states and the main performance measures of the tandem queue under consideration are calculated. Illustrative numerical examples are presented.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Graham, A.: Kronecker Products and Matrix Calculus with Applications. Ellis Horwood, Cichester (1981)
He, Q.M.: Queues with marked customers. Advances in Applied Probability 28, 567–587 (1996)
Kim, C.S., Dudin, S.: Priority tandem queueing model with admission control. Computers and Industrial Engineering 60 (2011), doi:10.1016/j.cie.2011.03.003
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)
Neuts, M.: Matrix-Geometric Solutions in Stochastic Models - An Algorithmic Approach. Johns Hopkins University Press, Baltimore (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klimenok, V., Kim, C.S., Dudin, A. (2011). Tandem Queueing System with Different Types of Customers. In: Al-Begain, K., Balsamo, S., Fiems, D., Marin, A. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2011. Lecture Notes in Computer Science, vol 6751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21713-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21713-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21712-8
Online ISBN: 978-3-642-21713-5
eBook Packages: Computer ScienceComputer Science (R0)