Information theoretic approximations for the \(M/G/1\) retrial queue
In this paper we present information theoretic approximations for the M/G/1 queue with retrials. Various approximations for this model are obtained according to the available information about the service time probability density and the steady-state distribution of the system state. The results are well-suited for numerical computation.
scientific article; zbMATH DE number 695008
scientific article