Analysis of MAP/M/2/K Queueing Model with Resequencing Buffer
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.