2018 ◽  
Vol 123-124 ◽  
pp. 35-49 ◽  
Author(s):  
Dieter Fiems ◽  
Michel Mandjes ◽  
Brendan Patch

2013 ◽  
Vol 29 (1) ◽  
pp. 112-127 ◽  
Author(s):  
J. Blom ◽  
M. Mandjes ◽  
H. Thorsdottir

1991 ◽  
Vol 23 (01) ◽  
pp. 188-209 ◽  
Author(s):  
Peter W. Glynn ◽  
Ward Whitt

This paper presents a new approach for obtaining heavy-traffic limits for infinite-server queues and open networks of infinite-server queues. The key observation is that infinite-server queues having deterministic service times can easily be analyzed in terms of the arrival counting process. A variant of the same idea applies when the service times take values in a finite set, so this is the key assumption. In addition to new proofs of established results, the paper contains several new results, including limits for the work-in-system process, limits for steady-state distributions, limits for open networks with general customer routes, and rates of convergence. The relatively tractable Gaussian limits are promising approximations for many-server queues and open networks of such queues, possibly with finite waiting rooms.


Sign in / Sign up

Export Citation Format

Share Document