Geometric lower bounds on queue occupancy in limited-connectivity processing networks show that asymptotic performance matching Power-of-d or JSQ requires flexibility metrics to diverge to infinity.
Extremal properties of the short- est/longest non-full queue policies in finite-capacity systems with state-dependent ser- vice rates
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Geometric lower bounds for the steady-state occupancy of processing networks with limited connectivity
Geometric lower bounds on queue occupancy in limited-connectivity processing networks show that asymptotic performance matching Power-of-d or JSQ requires flexibility metrics to diverge to infinity.