On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
By Alexander L. Stolyar. Operational Research, 2005
332 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/cd8231a86589d205c64167ad462671c357f56d8d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Mung Chiang
- John C. Doyle
- Steven H. Low
- A. Robert Calderbank
- Sanjay Shakkottai
- Aamod Khandekar
- Ashwin Sampath
- Gustavo De Veciana
In Electrical and Electronic Engineering
- Mung Chiang
- John C. Doyle
- Steven H. Low
- A. Robert Calderbank
- Sanjay Shakkottai
- Aamod Khandekar
- Ashwin Sampath
- Gustavo De Veciana
Citations in the corpus
- Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures (2007, background): “3) Channel level stochastic: Models in [17], [35], [81], [99], [128] consider random channel fluctuations.”
- Cell Association and Interference Coordination in Heterogeneous LTE-A Cellular Networks (2010, methodology): “The resulting scheduler (i) roughly speaking, maximizes the sum of utilities of average rates for small αis when all flows are best effort (follows from [18]), and (ii) stabilizes the”
- Joint Scheduling of URLLC and eMBB Traffic in 5G Wireless Networks (2017, methodology): “Thus, at face-value, it appears that we can immediately apply the gradient scheduler introduced in [15], which is an online algorithm that converges and solves the optimization problem.”