Efficient computations for the discrete GI/G/1 system
We consider the discrete-time GI/G/1 system with discrete interarrival times and service-times distributions that have finite supports, and formulate it as a PH/PH/1 system. We then take advantage of the resulting special structure to develop efficient methods for computing its rate matrices and the decay rates of its queue length and waiting time.
discrete gi/g/1 systems queue length waiting time matrix-analytic methods discrete ph/ph/1 systems tail probabilities