The $$MMAP\left[ K \right]/PH\left[ K \right]/1$$ queues with a last-come-first-served preemptive service discipline

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.

[1]  Tetsuya Takine,et al.  A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure , 1995 .

[2]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[3]  Russell Lyons,et al.  Random Walks, Capacity and Percolation on Trees , 1992 .

[4]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[5]  Qi-Ming He,et al.  Queues with marked customers , 1996, Advances in Applied Probability.

[6]  Marcel F. Neuts,et al.  Markov chains with marked transitions , 1998 .

[7]  Raymond W. Yeung,et al.  Matrix product-form solutions for Markov chains with a tree structure , 1994 .

[8]  R. Lyons.  Random Walks and Percolation on Trees , 1990 .

[9]  Vaidyanathan Ramaswami,et al.  A logarithmic reduction algorithm for quasi-birth-death processes , 1993, Journal of Applied Probability.

[10]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[11]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[12]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[13]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[14]  Tetsuya Takine,et al.  The workload in the MAP/G/1 queue with state-dependent services: its application to a queue with preemptive resume priority , 1994 .

[15]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[16]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .

[17]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[18]  M. Neuts.  A Versatile Markovian Point Process , 1979 .

[19]  Qi-Ming He,et al.  Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue , 2000, Eur. J. Oper. Res..

[20]  F. R. Gantmakher.  The Theory of Matrices , 1984 .