Throughput Optimal Scheduling Policies in Networks of Interacting Queues

TL;DR

This paper develops a general framework for throughput optimal scheduling in complex queuing networks, introducing new classes of policies and extending stability analysis methods to accommodate Markov-modulated arrivals and dynamic constraints.

Contribution

It provides a unified set of sufficient conditions for throughput optimality, generalizing previous results and defining new classes of scheduling policies for interacting queues.

Findings

Derived sufficient conditions for throughput optimality.

Introduced new classes of scheduling policies.

Extended Lyapunov drift methods for stability analysis.

Abstract

This report considers a fairly general model of constrained queuing networks that allows us to represent both MMBP (Markov Modulated Bernoulli Processes) arrivals and time-varying service constraints. We derive a set of sufficient conditions for throughput optimality of scheduling policies that encompass and generalize all the previously obtained results in the field. This leads to the definition of new classes of (non diagonal) throughput optimal scheduling policies. We prove the stability of queues by extending the traditional Lyapunov drift criteria methodology.