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

被引：0

作者：

He, QM ^{[1
]}

Alfa, AS

机构：

[1] Dalhousie Univ, Dept Ind Engn, Halifax, NS B3J 2X4, Canada

[2] Univ Manitoba, Dept Mech & Ind Engn, Winnipeg, MB, Canada

来源：

QUEUEING SYSTEMS | 1998年 / 29卷 / 2-4期

关键词：

queueing theory; matrix analytic methods; tree structure; LCFS; quasi-birth-and-death Markov process;

D O I：

10.1023/A:1019140332008

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：269 / 291

页数：23

共 47 条

[1] The MMAP[K]/PH[K]/1 queues with a last-come-first-served preemptive service discipline
Department of Industrial Engineering, DalTech, Dalhousie University, Halifax, NS B3J 2X4, Canada
[J]. Queueing Syst., 2-4 (269-291):
[2] Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline
He, Qi-Ming
Alfa, Attahiru Sule
[J]. 2000, John Wiley & Sons Inc, New York, NY, United States (47)
[3] ON THE SINGLE-SERVER QUEUE WITH THE PREEMPTIVE-RESUME LAST-COME-FIRST-SERVED QUEUE DISCIPLINE
FAKINOS, D
[J]. JOURNAL OF APPLIED PROBABILITY, 1986, 23 (01) : 243 - 248
[4] Computational analysis of MMAP[K]/PH [K]/1 queues with a mixed FCFS and LCFS service discipline
He, QM
Alfa, AS
[J]. NAVAL RESEARCH LOGISTICS, 2000, 47 (05) : 399 - 421
[5] The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue
Van Houdt, B
Blondia, C
[J]. JOURNAL OF APPLIED PROBABILITY, 2002, 39 (01) : 213 - 223
[6] The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$MMAP\left[ K \right]/PH\left[ K \right]/1$$ \end{document} queues with a last-come-first-served preemptive service discipline
Qi-Ming He
Attahiru Sule Alfa
[J]. Queueing Systems, 1998, 29 (2-4) : 269 - 291
[7] A NOTE ON WAITING-TIME DISTRIBUTION FOR M/G/1 QUEUE WITH LAST-COME-FIRST-SERVED
KEILSON, J
[J]. OPERATIONS RESEARCH, 1968, 16 (06) : 1230 - &
[8] OPTIMAL BUFFER ALLOCATION IN TANDEMS OF LAST COME FIRST SERVED QUEUES
ANANTHARAM, V
GANESH, A
[J]. QUEUEING SYSTEMS, 1995, 20 (3-4) : 395 - 407
[9] ON THE OPTIMALITY OF 1ST COME LAST SERVED QUEUES
HASSIN, R
[J]. ECONOMETRICA, 1985, 53 (01) : 201 - 202
[10] A NEW LOOK AT TRANSIENT VERSIONS OF LITTLE'S LAW, AND M/G/1 PREEMPTIVE LAST-COME FIRST-SERVED QUEUES
Fralix, Brian H.
Riano, German
[J]. JOURNAL OF APPLIED PROBABILITY, 2010, 47 (02) : 459 - 473

← 1 2 3 4 5 →