Article ID: | iaor20162445 |
Volume: | 83 |
Issue: | 1 |
Start Page Number: | 13 |
End Page Number: | 28 |
Publication Date: | Jun 2016 |
Journal: | Queueing Systems |
Authors: | Shah Virag, Veciana Gustavo |
Keywords: | networks, networks: scheduling, allocation: resources, programming: dynamic, combinatorial optimization |
We consider multi‐class multi‐server queuing systems where a subset of servers, called a server pool, may collaborate in serving jobs of a given class. The pools of servers associated with different classes may overlap, so the sharing of server resources across classes is done via a dynamic allocation policy based on a fairness criterion. We consider an asymptotic regime where the total load increases proportionally with the system size. We show that under limited scaling in size of server pools the stationary distribution for activity of a