## Heavy Traffic Limits for Queues with Many Deterministic Servers

### Cached

### Download Links

- [www.ctr.columbia.edu]
- [ie.technion.ac.il]
- [www.ee.columbia.edu]
- DBLP

### Other Repositories/Bibliography

by
Predrag Jelenkovic
,
Avishai Mandelbaum
,
Petar Momcilovic

Citations: | 24 - 3 self |

### BibTeX

@MISC{Jelenkovic_heavytraffic,

author = {Predrag Jelenkovic and Avishai Mandelbaum and Petar Momcilovic},

title = {Heavy Traffic Limits for Queues with Many Deterministic Servers},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

Consider a sequence of stationary GI/D/N queues indexed by N with servers' utilization 1 #/ # N , # > 0. For such queues we show that the scaled waiting times NWN converge to the (finite) supremum of a Gaussian random walk with drift -#.