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

DOI10.1007/S11134-006-0067-2zbMATH Open1112.90014OpenAlexW2142782680MaRDI QIDQ855001FDOQ855001

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

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

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)

Cites Work

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

Cited In (7)

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

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)