The Discrete Time MMAP [ K ] / PH [ K ] / 1 / LCFS-GPR Queue and Its Variants

Abstract: In this paper, we study a discrete time queueing system with multiple types of customers and a last-come-first-served general preemptive resume (LCFS-GPR) service discipline (MMAP[K]/PH[K]/1/LCFS-GPR). When the waiting space is infinite, matrix analytic methods are used to find a system stability condition, to derive the distributions of the busy periods and sojourn times, and to obtain a matrix geometric solution of the queue string. The results lead to efficient algorithms for computing various performance measures at the level of individual types of customers. Using those algorithms, the impact of the LCFS-GPR service discipline on the corresponding queueing system can be analyzed. When the waiting space is finite, the Gaussian elimination method is used to develop an efficient algorithm for computing the stationary distribution of the queue string. The relationship between the loss probabilities of individual types of customers and the size of the waiting space is explored. This paper also serves as a brief survey of the study of the MMAP[K]/PH[K]/1 queue and its related queueing models.

[1]  Qi-Ming He.  Classification of Markov Processes of Matrix M/G/l type with a Tree Structure and its Applications to the MMAP[K]/G[K]/1 Queues , 2000 .

[2]  Attahiru Sule Alfa,et al.  Waiting Time Distribution Of A Fifo/Lifo Geo/D/1 Queue , 1999 .

[3]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

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

[5]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.

[6]  Qi-Ming He.  Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models , 2000, Oper. Res. Lett..

[7]  A. Alfa,et al.  The MMAP [ K ] / PH [ K ] / 1 queues with a last-come-first-served preemptive service discipline , 1998 .

[8]  Attahiru Sule Alfa,et al.  The $$MMAP\left[ K \right]/PH\left[ K \right]/1$$ queues with a last-come-first-served preemptive service discipline , 1998, Queueing Syst. Theory Appl..

[9]  B. T. Doshi.  An M/G/1 queue with a hybrid discipline , 1983, The Bell System Technical Journal.

[10]  M. Neuts,et al.  A SINGLE-SERVER QUEUE WITH SERVER VACATIONS AND A CLASS OF NON-RENEWAL ARRIVAL PROCESSES , 1990 .

[11]  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 .

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

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

[14]  V. Ramaswami.  The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

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

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

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

[18]  V. Ramaswami.  THE N/G/1 QUEUE AND ITS DETAILED ANALYSIS , 1980 .

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

[20]  Attahiru Sule Alfa,et al.  The quasi-birth-death type markov chain with a tree structure , 1999 .

[21]  Peter Lancaster,et al.  The theory of matrices , 1969 .