Limits for queues as the waiting room grows

We study the convergence of finite-capacity open queueing systems to their infinite-capacity counterparts as the capacity increases. Convergence of the transient behavior is easily established in great generality provided that the finite-capacity system can be identified with the infinite-capacity system up to the first time that the capacity is exceeded. Convergence of steady-state distributions is more difficult; it is established here for the GI/GI/c/n model withc servers,n-c extra waiting spaces and the first-come first-served discipline, in which all arrivals finding the waiting room full are lost without affecting future arrivals, via stochastic dominance and regenerative structure.

[1]  Eugene Seneta,et al.  Computing the stationary distribution for infinite Markov chains , 1980 .

[2]  V. Kalashnikov,et al.  The analysis of continuity of queueing systems , 1983 .

[3]  D. Sonderman.  Comparing multi-server queues with finite waiting rooms, I: Same number of servers , 1979, Advances in Applied Probability.

[4]  Eugene Seneta,et al.  Augmented truncations of infinite stochastic matrices , 1987 .

[5]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[6]  A. A. Borovkov,et al.  Asymptotic Methods in Queueing Theory. , 1986 .

[7]  S. T. Rachev,et al.  The problem of stability in queueing theory , 1989, Queueing Syst. Theory Appl..

[8]  A. Brandt,et al.  On the continuity of G/GI/m queues , 1983 .

[9]  P. Franken,et al.  Queues and Point Processes , 1983 .

[10]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[11]  G. Reuter,et al.  Spectral theory for the differential equations of simple birth and death processes , 1954, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[12]  A. Karr.  Weak convergence of a sequence of Markov chains , 1975 .

[13]  D. Wolf,et al.  Approximation of the invariant probability measure of an infinite stochastic matrix , 1980, Advances in Applied Probability.

[14]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[15]  V. Schmidt,et al.  Queues and Point Processes , 1983 .

[16]  W. Whitt,et al.  Open and closed models for networks of queues , 1984, AT&T Bell Laboratories Technical Journal.

[17]  W. Whitt,et al.  The asymptotic behavior o queues with time-varying arrival rates , 1984, Journal of Applied Probability.

[18]  Ward Whitt,et al.  Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..

[19]  J. Kiefer,et al.  On the theory of queues with many servers , 1955 .

[20]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[21]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[22]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[23]  W. Whitt.  Embedded renewal processes in the GI/G/s queue , 1972, Journal of Applied Probability.

[24]  Ward Whitt,et al.  Some Useful Functions for Functional Limit Theorems , 1980, Math. Oper. Res..