On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
From MaRDI portal
Publication:5322069
DOI10.1287/opre.1040.0156zbMath1165.90408OpenAlexW2141789294MaRDI QIDQ5322069
Publication date: 17 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cd8231a86589d205c64167ad462671c357f56d8d
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)
Related Items
Greedy primal-dual algorithm for dynamic resource allocation in complex networks ⋮ Mean-Field Limits for Large-Scale Random-Access Networks ⋮ Optimal size-based opportunistic scheduler for wireless systems ⋮ Utility maximization for asynchronous streaming of bufferable information flows ⋮ Random algorithms for convex minimization problems ⋮ Choosing among hospitals in the subsidized health insurance system of China: a sequential game approach ⋮ Flow-level performance and capacity of wireless networks with user mobility ⋮ Ergodic Convergence of a Stochastic Proximal Point Algorithm ⋮ Flow-level performance and user mobility in wireless data networks ⋮ Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
This page was built for publication: On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
