2020
DOI: 10.1287/stsy.2019.0038
|View full text |Cite
|
Sign up to set email alerts
|

Fluctuation Bounds for the Max-Weight Policy with Applications to State Space Collapse

Abstract: We consider a multi-hop switched network operating under a Max-Weight (MW) scheduling policy, and show that the distance between the queue length process and a fluid solution remains bounded by a constant multiple of the deviation of the cumulative arrival process from its average. We then exploit this result to prove matching upper and lower bounds for the time scale over which additive state space collapse (SSC) takes place. This implies, as two special cases, an additive SSC result in diffusion scaling unde… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(17 citation statements)
references
References 46 publications
0
17
0
Order By: Relevance
“…For simplicity and ease of presentation, we restrict ourselves to single-hop networks. However, our results are easily generalized to multi-hop networks of the type considered in [18].…”
Section: Introductionmentioning
confidence: 95%
See 3 more Smart Citations
“…For simplicity and ease of presentation, we restrict ourselves to single-hop networks. However, our results are easily generalized to multi-hop networks of the type considered in [18].…”
Section: Introductionmentioning
confidence: 95%
“…The literature provides a few, somewhat different but equivalent, definitions of the fluid model [16,12], which typically involve differential equations with boundary conditions. Here, we adopt an equivalent but somewhat simpler definition, 3 from [18].…”
Section: The Fluid Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…where the second and third inequalities follow from the definitions of ρ min and θ * in (14) and (60), respectively. Using also the fact d p i , B ρ (p i )\B r (p i ) ≥ r, we obtain…”
Section: Completing the Proof Of The Theoremmentioning
confidence: 99%