SCS

Abstract

Optimization and stochastic network theory have been used to successfully design architectures for fair resource allocation in wireless networks. In this talk, we will describe recent progress in extending this framework to design decentralized, low-complexity scheduling algorithms. Open problems in the design of scheduling algorithms to handle flow-level dynamics and per-packet deadlines will also be discussed.