Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) (Q1183691)

The authors consider the standard \(GI/G/1\)-queue with a first-come-first- served queue discipline for service time distributions with a rational Laplace-Stieltjes transform (LST). They present a unified approach to the computation of the (steady-state) distributions of (i) the actual queueing time, (ii) the virtual queueing time, (iii) the actual idle time, and (iv) the interdeparture time. In case of idle time and interdeparture time the interarrival time distributions are assumed to have a rational LST too. The approach follows classical ideas using Laplace-Stieltjes transforms. The central part of the procedure consists in evaluating the roots of a characteristic equation deduced by considering the denominator in the corresponding LST of the distribution of interest. Assuming that these roots are distinct, the authors use a partial fraction expansion to get representations of the distributions (and moments) in terms of these roots. In case of the idle-time distribution it is shown that the analysis goes through also in the case that the service-time distribution is not rational. Asymptotic results for the tail of the queueing time distribution are given too. The authors discuss numerical aspects and present a variety of numerical results. Furthermore an extensive discussion on related investigations in literature is given.