2000 character limit reached
New Representations for G/G/1 Waiting Times (1412.1203v1)
Published 3 Dec 2014 in math.PR
Abstract: 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.