Abstract
This paper studies two queueing systems with a Markov arrival process with marked arrivals and PH-distribution service times for each type of customer. Customers (regardless of their types) are served on a last-come-first-served preemptive resume and repeat basis, respectively. The focus is on the stationary distribution of queue strings in the system and busy periods. Efficient algorithms are developed for computing the stationary distribution of queue strings, the mean numbers of customers served in a busy period, and the mean length of a busy period. Comparison is conducted numerically between performance measures of queueing systems with preemptive resume and preemptive repeat service disciplines. A counter-intuitive observation is that for a class of service time distributions, the repeat discipline performs better than the resume one.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen and G. Koole, Marked point processes as limits of Markovian arrival streams, J. Appl. Probab. 30 (1993) 365–372.
F.R. Gantmacher, The Theory of Matrices (Chelsea, New York, 1959).
Q.-M. HE, Queues with marked customers, Adv. in Appl. Probab. 28 (1996) 567–587.
Q.-M. HE, Quasi-birth-and-death processes with a tree structure and a detailed analysis of the MMAP[K]/PH[K]/1 queue (1997) submitted for publication.
Q.-M. HE and M.F. Neuts, Markov arrival processes with marked transitions, Stochastic Process. Appl. 74(1) (1998) 37–52.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
G. Latouche and V. Ramaswami, A logarithmic reduction algorithm for quasi birth and death processes, J. Appl. Probab. 30 (1993) 650–674.
R. Lyons, Random walks and percolation on trees, Ann. Probab. 18 (1990) 931–958.
R. Lyons, Random walks, capacity and percolation on trees, Ann. Probab. 20 (1992) 2043–2088.
D.M. Lucantoni, New results on the single server queue with a batch Markovian arrival process, Stochastic Models 7 (1991) 1–46.
M.F. Neuts, A versatile Markovian point process, J. Appl. Probab. 16 (1979) 764–779.
M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).
M.F. Neuts, Structured Stochastic Matrices of M/G/1 Type and Their Applications (Marcel Dekker, New York, 1989).
M.F. Neuts, The joint distribution of arrivals and departures in quasi-birth-and-death processes, in: Numerical Solutions of Markov Chains, ed. W.J. Stewart (Marcel Decker, New York, 1991) pp. 147–159.
H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1 (Elsevier, Amsterdam, 1990).
H. Takagi, Queueing analysis of polling models: progress in 1990–1994, in: Frontiers in Queueing, ed. J.H. Dshalalow (1996) pp. 119–146.
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.
R.W. Yeung and B. Sengupta, Matrix product-form solutions for Markov chains with a tree structure, Adv. in Appl. Probab. 26(4) (1994) 965–987.
R.W. Yeung and A.S. Alfa, The quasi-birth-and-death type Markov chain with a tree structure, submitted for publication.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
He, QM., Alfa, A.S. The \(MMAP\left[ K \right]/PH\left[ K \right]/1\) queues with a last-come-first-served preemptive service discipline. Queueing Systems 29, 269–291 (1998). https://doi.org/10.1023/A:1019140332008
Issue Date:
DOI: https://doi.org/10.1023/A:1019140332008