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.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Strong Stability of Queueing Systems and Networks: a Survey and Perspectives;Queueing Theory 1;2021-04-12
2. References;Fundamentals of Queueing Theory;2018-04-12
3. Stability of Queueing Systems;The Methods of Distances in the Theory of Probability and Statistics;2012-11-12
4. References;Fundamentals of Queueing Theory;2008-07-25
5. Continuity theorems for the M/M/1/n queueing system;Queueing Systems;2008-05