Strong Approximations in Queueing Theory
P. W. Glynn
In Asymptotic Methods in Probability and Statistics [B. Szyszkowicz, ed.] Elsevier Science, The Netherlands, 135-150 (1998)
This paper discusses some of the merits of the strong approximation ideas in developing diffusion approximations for queueing systems. Letting ρ be the utilization of the server, it is well known that as the queue is sent into heavy-traffic (i.e. ρ->1), the system can be approximated by a diffusion process on spatial scales of order (1-ρ)-1 and time scales of order (1-ρ)-2. In this paper, we show how strong approximation methods permit one to validate the applicability of the diffusion approximation to the queue over other temporal and spatial scales. In addition, some pedagogical advantages of the stronga approximation approach are discussed, and two open problems for the strong approximation community are described.