Control of parallel non-observable queues: Asymptotic equivalence and optimality of periodic policies

Abstract

We consider a queueing system composed of a dispatcher that routes jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to minimize the stationary mean waiting time of the incoming jobs. We present a structural property that holds in the classic scaling of the system where the network demand (arrival rate of jobs) grows proportionally with the number of queues. Assuming that each queue of type r is replicated k times, we consider a set of policies that are periodic with period k r pr and such that exactly pr jobs are sent in a period to each queue of type r. When k → ∞, our main result shows that all the policies in this set are equivalent, in the sense that they yield the same mean stationary waiting time, and optimal, in the sense that no other policy having the same aggregate arrival rate to all queues of a given type can do better in minimizing the stationary mean waiting time. This property holds in a strong probabilistic sense. Furthermore, the limiting mean waiting time achieved by our policies is a convex function of the arrival rate in each queue, which facilitates the development of a further optimization aimed at solving the fundamental problem above for large systems.1. Introduction. In computer and communication networks, the access of jobs to resources (web servers, network links, etc.) is usually regulated by a dispatcher. A fundamental problem is which algorithm should the dispatcher implement to minimize the mean delay experienced by jobs. There is a vast literature on this subject and the structure of the optimal algorithm strongly depends on i) the information available to the dispatcher, ii) the topology of the network and iii) how jobs are processed by resources. We are interested in a scenario where: