Asymptotic optimality of maximum pressure policies in stochastic processing networks

DOI10.1214/08-AAP522zbMath1175.90083arXiv0901.2451OpenAlexW3099615934MaRDI QIDQ2378631

Wuqin Lin, J. G. Dai

Publication date: 13 January 2009

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.2451

zbMATH Keywords

heavy trafficasymptotic optimalitystate space collapsediffusion limitsmaximum pressure policiesBrownian modelsstochastic processing networksbackpressure policies

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Diffusion processes (60J60)

Related Items (27)

A push-pull network with infinite supply of work ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ Justifying diffusion approximations for multiclass queueing networks under a moment condition ⋮ On the asymptotic optimality of the \(c\mu\)-rule in queueing networks ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources ⋮ A fluid approach to large volume job shop scheduling ⋮ Asymptotically tight steady-state queue length bounds implied by drift conditions ⋮ On converse Lyapunov theorems for fluid network models ⋮ Controlled stochastic networks in heavy traffic: convergence of value functions ⋮ Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse ⋮ Randomized scheduling algorithm for queueing networks ⋮ The single-server scheduling problem with convex costs ⋮ Fluctuation Bounds for the Max-Weight Policy with Applications to State Space Collapse ⋮ Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality ⋮ A survey on skill-based routing with applications to service operations management ⋮ Optimal queue-size scaling in switched networks ⋮ Fluid models of congestion collapse in overloaded switched networks ⋮ Transform Methods for Heavy-Traffic Analysis ⋮ Optimal control of parallel server systems with many servers in heavy traffic ⋮ Diffusion approximations for controlled weakly interacting large finite state systems with simultaneous jumps ⋮ Diffusion approximations for load balancing mechanisms in cloud storage systems ⋮ On the Control of Fork-Join Networks ⋮ Heavy traffic analysis of maximum pressure policies for stochastic processing networks with multiple bottlenecks ⋮ Diffusion Limit of Fair Resource Control—Stationarity and Interchange of Limits ⋮ Optimal Control of Brownian Inventory Models with Convex Holding Cost: Average Cost Case ⋮ Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
• Stochastic discrete flow networks: Diffusion approximations and bottlenecks
• Uniqueness of solution in linear programming
• An invariance principle for semimartingale reflecting Brownian motions in an orthant
• Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse
• State space collapse with application to heavy traffic limits for multiclass queueing networks
• Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
• Instability of FIFO queueing networks
• Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
• Two workload properties for Brownian networks
• A broader view of Brownian networks
• MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
• Brownian models of open processing networks: Canonical representation of workload.
• Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
• Re-entrant lines
• Scheduling networks of queues: Heavy traffic analysis of a simple open network
• Heavy traffic limits for some queueing networks
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Heavy traffic resource pooling in parallel-server systems
• A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
• Diffusion Approximations for Some Multiclass Queueing Networks with FIFO Service Disciplines
• Resource Allocation and Cross-Layer Control in Wireless Networks
• Heavy Traffic Convergence of a Controlled, Multiclass Queueing System
• Dynamic server allocation to parallel queues with randomly varying connectivity
• Adaptive back-pressure congestion control based on local information
• A multiclass Station with Markovian Feedback in Heavy Traffic
• Allocation of interdependent resources for maximal throughput
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
• Maximum Pressure Policies in Stochastic Processing Networks
• Multiple channel queues in heavy traffic. I

This page was built for publication: Asymptotic optimality of maximum pressure policies in stochastic processing networks