Many-Server Queues with Random Service Rates in the Halfin-Whitt Regime: A Measure-Valued Process Approach
Preprint
Abstract
We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy traffic limit of these queues in random environment using probability measure-valued stochastic processes. We introduce the measure-valued fairness process which denotes the proportion of cumulative idleness experienced by servers whose rates fall in a Borel subset of the support of the service rates. It can be shown that these fairness processes do not converge in the usual Skorokhod-$J_1$ topology, hence we introduce a new notion of convergence based on shifted versions of these processes. We also introduce some useful martingales to identify limiting fairness processes under different routing policies.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Staffing call centers under arrival-rate uncertainty with Bayesian updatesOperations Research Letters, 2018
- Managing Queueing Systems Where Capacity is Random and Customers are ImpatientProduction and Operations Management, 2018
- SPDE limits of many-server queuesThe Annals of Applied Probability, 2013
- A blind policy for equalizing cumulative idlenessQueueing Systems, 2011
- Law of large numbers limits for many-server queuesThe Annals of Applied Probability, 2011
- Fluid limits of many-server queues with renegingThe Annals of Applied Probability, 2010
- Central limit theorem for a many-server queue with random service ratesThe Annals of Applied Probability, 2008
- Martingale proofs of many-server heavy-traffic limits for Markovian queuesProbability Surveys, 2007
- Dynamic Routing in Large-Scale Service Systems with Heterogeneous ServersQueueing Systems, 2005
- The fluid limit of a heavily loaded processor sharing queueThe Annals of Applied Probability, 2002