The explicit heavy-traffic limit conjecture with mobility
The explicit heavy-traffic limit conjecture with mobility
Assume . Let be the stationary queue-length vector, let be the traffic intensity, and define
Explicit heavy-traffic limit conjecture. As ,
This conjecture gives the explicit limit suggested by the conjectured empty-system exponential rate and would identify the exact logarithmic heavy-traffic asymptotics. The source presents it as a conjecture; the preceding theorem proves only tightness and an upper bound on accumulation points.
Sources & referencesView supporting material
Primary source
Florian Simatos and Alain Simonian, “Mobility can drastically improve the heavy traffic performance from 1/(1-rho) to -log(1-rho)”, arXiv:1909.04383 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.