The M/G/1 retrial queue: An information theoretic approach

Abstract

In this paper, we give a survey of the use of information theoretic techniques for the estimation of the main performance characteristics of the M/G/1 retrial queue. We focus on the limiting distribution of the system state, the length of a busy period and the waiting time. Numerical examples are given to illustrate the accuracy of the maximum entropy estimations when they are compared versus the classical solutions.