G/M/c/K Queue with Reneging and Retrial: Theoretical Background
Such a system is an advanced case of
M/M/c/K queue with reneging.
In some particular case, the
G/M/c/K queue with reneging and retrial can represent a retrial queuing system.
Entities arrive at a queue with
FIFO discipline according to a Poisson process.
The queue capacity is limited to
K waiting places.
The queue timeout (maximum waiting time) is exponentially distributed with a mean value of
T.
Entities from the queue are distributed between
C servers.
The service time value of all servers is exponentially distributed.
Free server is selected randomly.
The considered queuing system model represents already real objects.
The difference from the
M/M/c/K queue with reneging and retrial is that the entities rejected from the queue due to a timeout are split into two flows.
The entities of the first one are destroyed.
This simulates the loss of clients that don't want to try again to get service again.
The second flow entities are delayed for a while before being sent back to the queue.
This simulates the attempt of clients to get service again.
After some delay, these entities are mixed with newly arrived entities and passed together to the queue.
So, the mixed flow entering the queue is non-Poisson process, and, therefore, the designation of this system is
G/M/c/K queue with reneging and retrial, where
G stands for the general distribution.
The characteristics under study are the
probability of waiting,
mean waiting time and
mean queue length.
Since how an idle server is selected does not affect the characteristics of interest, this rule can be any, not necessarily random.