TY - JOUR
T1 - Analysis of MAP/M/2/K Queueing Model with Resequencing Buffer
AU - Chakravarthy, Srinivas R.
AU - Chukova, S.
AU - Dimitrov, Boyan
PY - 1998/1/1
Y1 - 1998/1/1
N2 - We consider a MAP/M/2/K queueing model in which messages should leave the system in the order in which they entered into the system. In the case of infinite resequencing buffer, the steady-state probability vector is shown to be of matrix-geometric type. The total sojourn time of an admitted message into the system is shown to be of phase type. Efficient algorithmic procedures for computing various performance measures are given, and some interesting numerical examples are discussed.
AB - We consider a MAP/M/2/K queueing model in which messages should leave the system in the order in which they entered into the system. In the case of infinite resequencing buffer, the steady-state probability vector is shown to be of matrix-geometric type. The total sojourn time of an admitted message into the system is shown to be of phase type. Efficient algorithmic procedures for computing various performance measures are given, and some interesting numerical examples are discussed.
KW - Markovian arriavals
KW - Exponential services
KW - Finite queue
KW - Matrix-geometric solution
KW - Phase type
KW - Algorithmic probability
UR - https://digitalcommons.kettering.edu/industrialmanuf_eng_facultypubs/99
UR - https://www.sciencedirect.com/science/article/pii/S0166531696000673
U2 - 10.1016/S0166-5316(96)00067-3
DO - 10.1016/S0166-5316(96)00067-3
M3 - Article
VL - 31
JO - Performance Evaluation
JF - Performance Evaluation
ER -