Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

The authors consider a class of queueing networks referred to as "Generalized constrained queueing networks" which form the basis of several different communication networks and information systems. These networks consist of a collection of queues such that only certain sets of queues can be concurrently served. Whenever a queue is served, the system receives a certain reward. Different rewards are obtained for serving different queues, and furthermore, the reward obtained for serving a queue depends on the set of concurrently served queues. They demonstrate that the dependence of the rewards on the schedules alter fundamental relations between performance metrics like throughput and stability.