Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
DOI10.1007/S11134-005-1450-0zbMATH Open1086.60059OpenAlexW2163634514MaRDI QIDQ2572913FDOQ2572913
Authors: Alexander L. Stolyar 
Publication date: 7 November 2005
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-005-1450-0
Recommendations
- Greedy primal-dual algorithm for dynamic resource allocation in complex networks
- Utility Optimization in Congested Queueing Networks
- Scheduling and congestion control for wireless and processing networks
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation
convex optimizationresource allocationschedulingwirelesscongestion controlpower and rate constraints
Convex programming (90C25) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The mathematics of internet congestion control
- 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
- A Unifying Passivity Framework for Network Flow Control
- Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Title not available (Why is that?)
- A framework for opportunistic scheduling in wireless networks.
- Opportunistic beamforming using dumb antennas
- On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
- Maximum Pressure Policies in Stochastic Processing Networks
- Fairness and stability of end-to-end congestion control
- Allocation of interdependent resources for maximal throughput
- Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities
Cited In (26)
- Utility Optimization in Congested Queueing Networks
- Online self-organizing network control with time averaged weighted throughput objective
- Randomized scheduling algorithm for queueing networks
- Reward maximization in general dynamic matching systems
- The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization
- Greedy primal-dual algorithm for dynamic resource allocation in complex networks
- Resource scheduling and energy cooperation in hetnet with cross-layer interference constraints
- Interior-point-based online stochastic bin packing
- Fluctuation Bounds for the Max-Weight Policy with Applications to State Space Collapse
- Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation
- Scheduling and congestion control for wireless and processing networks
- Resource Allocation Under Uncertainty Using the Maximum Entropy Principle
- Queue-proportional rate allocation with per-link information in multihop wireless networks
- Large number of queues in tandem: scaling properties under back-pressure algorithm
- Generalised minimum variance control of queues in packet switching networks
- Control of systems with flexible multi-server pools: a shadow routing approach
- Optimal Distributed Uplink Channel Allocation: A Constrained MDP Formulation
- On distributed scheduling with heterogeneously delayed network-state information
- Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
- Towards a queueing-based framework for in-network function computation
- Stochastic network optimization with application to communication and queueing systems
- Worst-Case Efficiency Analysis of Queueing Disciplines
- Discount targeting in online social networks using backpressure-based learning
- Stability and probability. I: Convergence for queueing networks via Lyapunov optimization
- How Expensive Is Link Utilization?
- Resource allocation in communication networks with large number of users: the dual stochastic gradient method
This page was built for publication: Maximizing queueing network utility subject to stability: greedy primal-dual algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572913)
