Numerical Solution for M/G/1 Queueing System Using ETAQA

Abstract

In this paper we present the ETAQA (Efficient Technique for the Analysis of Quasi-birth and death processes by Aggregation) approach for the exact analysis of M/G/1 queueing processes. In contrast to other solution techniques for the M/G/1, the ETAQA exploit the repetitive structure of the infinite portion of the chain to derive a finite system of equations. The solutions presented here are exact and less expensive when compared to other methods.

Keywords: Markov chain, QBD, ETAQA and M/G/1 processes.