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

Authors:
Qi-Ming He;Attahiru Sule Alfa
Affiliations:
Department of Industrial Engineering, DalTech, Dalhousie University, Halifax, Nova Scotia, Canada B3J 2X4 E-mail: Qi-Ming.He@ dal.ca;Department of Mechanical and Industrial Engineering, University of Manitoba, Canada E-mail: alfa@ cc.umanitoba.ca
Venue:
Queueing Systems: Theory and Applications
Year:
1998

Citing 1
Cited 7

Queueing analysis of polling models: progress in 1990-1994

Frontiers in queueing

The Versatility of MMAP[K] and the MMAP[K]/G[K]/1 Queue

Queueing Systems: Theory and Applications
Matrix Product-Form Solution for an LCFS-PR Single-Server Queue with Multiple Arrival Streams Governed by a Markov Chain

Queueing Systems: Theory and Applications
Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue

Queueing Systems: Theory and Applications
Transient analysis of tree-Like processes and its application to random access systems

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Multi-class Markovian arrival processes and their parameter fitting

Performance Evaluation
A queueing model for multi-product production system under varying manufacturing environment

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.