New Representations for G/G/1 Waiting Times

Michael L. Wenocur

Published 2014-12-03Version 1

We obtain an explicit representation for the Laplace transform of the waiting time for a wide class of distributions by solving the Wiener-Hopf factorization problem via the Hadamard product theorem. Under broad conditions it is shown that this representation is invertible by an infinite partial fraction expansion. Computational schema illustrated by a variety of examples demonstrate the feasibility of numerically solving a rich class of G/G/1 queue possessing either bounded service or arrival times. In particular very tractable computations are derived for the M/M/1 queue with gated arrivals.