Heavy-traffic Gamma limit conjecture for length-biased cycle time
Let denote the cycle time seen by an arbitrary customer or arrival at queue , and let denote its scaled length-biased version. Let and be as defined above, and let be the quantity defined in Definition. Scaled cycle-time conjecture. As , converges in distribution to a random variable having a Gamma distribution with shape parameter and rate parameter . 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
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.