On Stability Region and Delay Performance of Linear-Memory Randomized Scheduling for Time-Varying Networks


Throughput optimal scheduling policies in general require the solution of a complex and often NP-hard optimization problem. Related literature has shown that in the context of time-varying channels, randomized scheduling policies can be employed to reduce the complexity of the optimization problem but at the expense of a memory requirement that is… (More)
DOI: 10.1109/TNET.2009.2017742


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics