Optimal Multi-Server Allocation to Parallel Queues With Independent Random Queue-Server Connectivity
The authors investigate an optimal scheduling problem in a discrete-time system of L parallel queues that are served by K identical, randomly connected servers. Each queue may be connected to a subset of the K servers during any given time slot. This model has been widely used in studies of emerging 3G/4G wireless systems. They introduce the class of Most Balancing (MB) policies and provide their mathematical characterization. They prove that MB policies are optimal; they define optimality as minimization, in stochastic ordering sense, of a range of cost functions of the queue lengths, including the process of total number of packets in the system.