Critically loaded queueing models that are throughput suboptimal (Q1024890)

The queueing model under consideration has multiple customer classes, indexed by a finite set \(I\), and heterogeneous exponential servers. The servers are grouped in pools, indexed by a finite set \(J\), and it is assumed that each pool has a large number of servers that have identical capabilities. The rate \(\mu _{ij} \), at which a server from pool \(j \in J\) serves customers from class \(i \in I\), depends on both \(i\) and \(j\). The arrival of class-\(i\) customers is modeled as a renewal process with rate \(\lambda _i \). Servers are dynamically chosen to serve customers, and buffers are available to accommodate customers that wait to be served. The model is considered in a many-server heavy traffic regime, in which the number of servers at each pool and the arrival rates are scaled up at a nearly fixed proportion, and in such a way that the processes that represent the number of class-\(i\) customers in the system fluctuate about a certain static fluid model. This fluid model is assumed to be critically loaded, in a standard sense. In particular, (1) servers can be allocated in such a way that the total processing rate devoted to class-\(i\) customers is equal to the arrival rate \(\lambda _i \), for every \(i \in I\); and (2) property (1) does not hold if one of the arrival rates \(\lambda _i \) is replaced by some \(\lambda _i^1 > \lambda _i \). It is possible for such a model to satisfy the following condition: servers can be allocated so as to achieve a total processing rate that is greater than the total arrival rate. If this condition holds, the fluid model is said to be throughout suboptimal. The main result shows that when the fluid model is throughout suboptimal, one can find a dynamic control policy for the queueing model that exhibits a strong form of efficiency: under this policy, for every finite \(T\), the measure of the set of times prior to \(T\), at which at least one customer is in the buffer, converges to zero in probability as the arrival rates and number or servers go to infinity.