Skip to content



Scheduling in Wireless Networks

Srikant, R (Illinois)
Monday 22 March 2010, 15:30-16:30

Seminar Room 1, Newton Institute


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.


[pdf ]


The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧