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

DOI10.1007/S11134-006-0067-2MaRDI QIDQ855001zbMATH OpenOpenAlexFDO

Authors 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

Convex optimizationResource allocationQueueing networksDynamic schedulingGreedy primal-dual algorithmNonlinear constraints

Mathematics Subject Classification ID

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

Recommendations

• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Resource allocation in communication networks with large number of users: the dual stochastic gradient method
• Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation
• Utility Optimization in Congested Queueing Networks
• Stability of primal-dual gradient dynamics and applications to network optimization

Cites work

• scientific article; zbMATH DE number 3148887 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Capacity and Delay Tradeoffs for Ad Hoc Mobile Networks
• Fairness and stability of end-to-end congestion control
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
• Opportunistic beamforming using dumb antennas
• Rate control for communication networks: shadow prices, proportional fairness and stability

Cited in

(9)

• Stochastic programming with primal-dual dynamics: a mean-field game approach
• Stability of primal-dual gradient dynamics and applications to network optimization
• Reward maximization in general dynamic matching systems
• Measuring Performance of Integrated Air Defense Networks Using Stochastic Networks
• Utility maximization for asynchronous streaming of bufferable information flows
• Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
• Resource allocation in communication networks with large number of users: the dual stochastic gradient method
• How to allocate goods in an online market?
• Continuity and monotonicity of solutions to a greedy maximization problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855001)