An Algorithm for Computing Serial Correlations of Times in GI/G/1 Queues with Rational Arrival Processes
An algorithm is given for computing the serial correlations of the waiting time, and of the time in system, for successive customers in a GI/G/1 queue. The method depends on representing the inter-arrival time distribution in terms of a process in class K r (i.e., distributions with a rational Laplace transform). Thus Erlang, hyperexponential and weighted sum-of-Erlang arrivals are treated exactly, and approximate results can be found for other distributions. Computed correlation functions for some Erlang/Erlang systems are presented as examples.
Volume (Year): 25 (1979)
Issue (Month): 1 (January)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:25:y:1979:i:1:p:54-63. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.