A new O(1/(1-ρ)) upper bound on expected queue length for light-tailed G/G/n queues is established via leave-one-out coupling and quadratic test functions, with improved leading constants and extension to heterogeneous servers.
Title resolution pending
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
-
A new $1/(1-\rho)$-scaling bound for multiserver queues via a leave-one-out technique
A new O(1/(1-ρ)) upper bound on expected queue length for light-tailed G/G/n queues is established via leave-one-out coupling and quadratic test functions, with improved leading constants and extension to heterogeneous servers.