The continuity of the single server queue

Publisher Website
Google Scholar
Abstract
In many applications of queueing theory assumptions of either Poisson arrivals or exponential service times are made. The implicit assumption is that if the actual arrival process approximates a Poisson process and the service times are close to exponential, then the quantities of interest in the real queueing system (viz. the virtual waiting time, queue length, idle times, etc.), will approximate those of the idealized model. The continuity of the single server queue acting as functionals of the arrival and service processes is established. The proof involves an application of the theory of weak convergence of probability measures on metric spaces.

This publication has 1 reference indexed in Scilit: