Discrete-time analysis of MAP/PH/1 multiclass general preemptive priority queue

✍ Scribed by Attahiru Sule Alfa; Bin Liu; Qi-Ming He

• Publisher: John Wiley and Sons
• Year: 2003
• Tongue: English
• Weight: 192 KB
• Volume: 50
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/nav.10083

✦ Synopsis

Abstract

We use the matrix‐geometric method to study the __MAP/PH/__1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for __M/M/__1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.