Abstract
This paper considers a stationary single-server queue with multiple arrival streams governed by a Markov chain, where customers are served on an LCFS preemptive-resume basis. Service times of customers from each arrival stream are generally distributed and service time distributions for different arrival streams may be different. Under these assumptions, it is shown that the stationary joint distribution of queue strings representing from which arrival stream each customer in the system arrived and remaining service times of respective customers in the system has a matrix product-form solution, where matrices constituting the solution are given in terms of the infinitesimal generator of a certain Markov chain. Compared with the previous works, the result in this paper is more general in the sense that general service time distributions are allowed, and it has the advantage of computational efficiency. Note also that the result is a natural extension of the classical result for the LCFS-PR M/G/1 queue. Further, utilizing the matrix product-form solution, we derive a new expression of the vector Laplace–Stieltjes transform of the stationary distribution of unfinished work in the work-conserving single-server queue with multiple arrival streams governed by a Markov chain, which is given by the sum of matrix-geometric series.
Similar content being viewed by others
References
S. Asmussen, Ladder heights and the Markov-modulated M/G/1 queue, Stochactic Process. Appl. 37 (1991) 313-326.
F.R. Gantmacher, The Theory of Matrices, Vol. 2 (Chelsea, New York, 1959).
Q.-M. He, Queues with marked customers, Adv. in Appl. Probab. 28 (1996) 567-587.
Q.-M. He and M.F. Neuts, Markov chains with marked transitions, Stochactic Process. Appl. 74 (1998) 37-52.
Q.-M. He and A.S. Alfa, The MMAP[K]/PH[K]/1 queues with a last-come-first-served preemptive service discipline, Queueing Systems 29 (1998) 269-291.
D.P. Heyman and S. Stidham, Jr., The relation between customer and time averages in queues, Oper. Res. 28 (1980) 983-994.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, Chichester, 1979).
R.M. Loynes, The stability of a queue with non-independent interarrival and service times, Proc. Cambridge Philos. Soc. 58 (1962) 497-520.
D.M. Lucantoni, K.S. Meier-Hellstern and M.F. Neuts, A single-server queue with server vacations and a class of non-renewal arrival processes, Adv. in Appl. Probab. 22 (1990) 676-705.
B. Sengupta, T. Takine and R.W. Yeung, Matrix-analytic methods for Markov chains on a tree structure, in: Matrix-Analytic Methods in Stochastic Models, eds. S.R. Chakravarthy and A.S. Alfa (1996) 297-311.
T. Takine and T. Hasegawa, The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priority, Stochastic Models 10 (1994) 183-204.
T. Takine, B. Sengupta and R.W. Yeung, A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure, Stochastic Models 11 (1995) 411-421.
T. Takine, A continuous version of matrix-analytic methods with the skip-free to the left property, Stochastic Models 12 (1996) 673-682.
T. Takine, Distributional form of Little's law for FIFO queues with multiple Markovian arrival streams and its application to queues with vacations. Queueing Systems 37 (2001) 31-63.
H.C. Tijms, Stochastic Models, An Algorithmic Approach (Wiley, Chichester, 1994).
R.W. Yeung and B. Sengupta, Matrix product-form solutions for Markov chains with a tree structure, Adv. in Appl. Probab. 26 (1994) 965-987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Takine, T. Matrix Product-Form Solution for an LCFS-PR Single-Server Queue with Multiple Arrival Streams Governed by a Markov Chain. Queueing Systems 42, 131–151 (2002). https://doi.org/10.1023/A:1020152920794
Issue Date:
DOI: https://doi.org/10.1023/A:1020152920794