Heavy-traffic Gamma limit conjecture for length-biased cycle time

About 10 years old · traced to

Let CiC_i denote the cycle time seen by an arbitrary customer or arrival at queue ii, and let Ci\bm{C_i} denote its scaled length-biased version. Let α\alpha and μ\mu be as defined above, and let δ\delta be the quantity defined in Definition. Scaled cycle-time conjecture. As ρ↑1\rho\uparrow1, (1−ρ)Ci(1-\rho)C_i converges in distribution to a random variable having a Gamma distribution with shape parameter α\alpha and rate parameter δμ\delta\mu. This conjecture supplies the length-biased cycle-time limit used in the subsequent heavy-traffic approximations; the source gives no general proof beyond the stated conjectural framework.

References

Primary source

Marko Boon, Rob van der Mei and Erik Winands, “Heavy traffic analysis of roving server networks”, arXiv:1611.02608 (2016).

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.