Efficient computations for the discrete GI/G/1 system

Efficient computations for the discrete GI/G/1 system

0.00 Avg rating0 Votes
Article ID: iaor200953697
Country: United States
Volume: 19
Issue: 3
Start Page Number: 480
End Page Number: 484
Publication Date: Jul 2007
Journal: INFORMS Journal On Computing
Authors: ,
Keywords: GI/G/1 queues
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.