Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse

DOI10.1214/11-AAP759zbMath1242.90066arXiv1004.1995OpenAlexW3105861207MaRDI QIDQ2428046

Damon J. Wischik, Devavrat Shah

Publication date: 20 April 2012

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

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

zbMATH Keywords

diffusion approximationheavy trafficfluid modelsstate space collapsemaximum weight schedulingswitched network

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (21)

An algorithm for improved delay-scaling in input-queued switches ⋮ Diffusion approximation for an input-queued switch operating under a maximum weight matching policy ⋮ Optimal heavy-traffic queue length scaling in an incompletely saturated switch ⋮ Model Predictive Control for Dynamic Resource Allocation ⋮ A load balancing system in the many-server heavy-traffic asymptotics ⋮ Optimal scaling of average queue sizes in an input-queued switch: an open problem ⋮ Log-weight scheduling in switched networks ⋮ Randomized scheduling algorithm for queueing networks ⋮ Dynamic server allocation for unstable queueing networks with flexible servers ⋮ Fluctuation Bounds for the Max-Weight Policy with Applications to State Space Collapse ⋮ Process Flexibility for Multiperiod Production Systems ⋮ Optimal queue-size scaling in switched networks ⋮ Lingering issues in distributed scheduling ⋮ Throughput optimal scheduling policies in networks of constrained queues ⋮ Fluid models of congestion collapse in overloaded switched networks ⋮ Information and Memory in Dynamic Resource Allocation ⋮ Diffusion limit for the partner model at the critical value ⋮ Concave switching in single-hop and multihop networks ⋮ Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations ⋮ Distributed link scheduling in wireless networks ⋮ Stability of longest-queue-first scheduling in linear wireless networks with multihop traffic and one-hop interference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
• 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
• 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.
• Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Weighted sums of certain dependent random variables
• Stochastic-Process Limits
• Dynamic Scheduling of a Four-Station Queueing Network
• Resource pooling in queueing networks with dynamic routing
• SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Maximum Pressure Policies in Stochastic Processing Networks
• Probability Inequalities for Sums of Bounded Random Variables
• Stability of queueing networks

This page was built for publication: Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse