Greedy primal-dual algorithm for dynamic resource allocation in complex networks

DOI10.1007/s11134-006-0067-2zbMath1112.90014OpenAlexW2142782680MaRDI QIDQ855001

Alexander L. Stolyar

Publication date: 20 December 2006

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-006-0067-2

zbMATH Keywords

Resource allocationConvex optimizationQueueing networksDynamic schedulingGreedy primal-dual algorithmNonlinear constraints

Mathematics Subject Classification ID

Convex programming (90C25) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Network protocols (68M12)

Related Items (4)

Stochastic programming with primal-dual dynamics: a mean-field game approach ⋮ Utility maximization for asynchronous streaming of bufferable information flows ⋮ Reward maximization in general dynamic matching systems ⋮ How to allocate goods in an online market?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Fairness and stability of end-to-end congestion control
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Capacity and Delay Tradeoffs for Ad Hoc Mobile Networks
• Opportunistic beamforming using dumb antennas
• On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

This page was built for publication: Greedy primal-dual algorithm for dynamic resource allocation in complex networks