The explicit heavy-traffic limit conjecture with mobility

About 7 years old · traced to

Assume θ>0\theta>0. Let X=(X1,X2)\boldsymbol{X}=(X_1,X_2) be the stationary queue-length vector, let ρ\rho be the traffic intensity, and define

ξ∗=(ρ11−ρ1,1).\boldsymbol{\xi}^*=\left(\frac{\rho_1}{1-\rho_1},1\right).

Explicit heavy-traffic limit conjecture. As ρ↑1\rho\uparrow1,

X(∞)−log⁡(1−ρ)⟹11−log⁡(1−ρ1) ξ∗.\frac{\boldsymbol{X}(\infty)}{-\log(1-\rho)}\Longrightarrow\frac{1}{1-\log(1-\rho_1)}\,\boldsymbol{\xi}^*.

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.

References

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.