### Abstract

We consider a heterogeneous queueing system consisting of one large pool of O(r) identical servers, where r→∞ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in the distributional sense. The system is heavily loaded in the Halfin-Whitt sense, namely the nominal utilization is, where a>0 is the spare capacity parameter. Our goal is to obtain bounds on the steady state performance metrics such as the number of customers waiting in the queue Q^{r}(∞). While there is a rich literature on deriving process level (transient) scaling limits for such systems, the results for steady state are primarily limited to the single class case. This paper is the first one to address the case of heterogeneity in the steady state regime. Moreover, our results hold for any service policy which does not admit server idling when there are customers waiting in the queue. We assume that the interarrival and service times have exponential distribution, and that customers of each class may abandon while waiting in the queue at a certain rate (which may be zero). We obtain upper bounds of the form, on both Q^{r}(∞) and the number of idle servers. The bounds are uniform w. r. t. parameter r and the service policy. In particular, we show that. Therefore, the sequence, is tight and has a uniform exponential tail bound. We further consider the system with strictly positive abandonment rates, and show that in this case every weak limit, has a sub-Gaussian tail. Namely, E[exp(theta(Q̂(∞))^{2})]< ∞, for some θ>0.

Original language | English (US) |
---|---|

Pages (from-to) | 25-51 |

Number of pages | 27 |

Journal | Queueing Systems |

Volume | 71 |

Issue number | 1-2 |

DOIs | |

State | Published - Jun 1 2012 |

### Fingerprint

### Keywords

- Exponential bounds
- Heavy traffic
- Limit interchange
- Multiclass multiserver system
- Stationary distribution asymptotics

### ASJC Scopus subject areas

- Statistics and Probability
- Computer Science Applications
- Management Science and Operations Research
- Computational Theory and Mathematics