The limiting generating-function conjecture for slowly controlled Markovian queues

Let QQ be the queue length and SS the server speed, and let u u be the measurement-rate parameter tending to zero. Define

P^(x,y):=limν0P(xν,yν),\hat{P}(x,y):=\lim_{\nu\to 0}P(x^\nu,y^\nu),

the generating function of the scaled pair (νQ,νS)(\nu Q,\nu S) in the limit ν0\nu\to 0. Limiting generating-function conjecture. The limiting generating function is

P^(x,y)=1211λlog(x)+1211λlog(y).\hat{P}(x,y)=\frac{1}{2}\frac{1}{1-\lambda\log(x)}+\frac{1}{2}\frac{1}{1-\lambda\log(y)}.

This conjecture formalizes the proposed cyclic fluid-scale behavior when measurements occur at a much slower rate: the queue alternates between growth while the server is stopped and rapid drainage after a control instant. The authors state that they were unable to formalize this intuition; no resolution is given here.

Sources & referencesView supporting material

Primary source

R. Núñez-Queija, B. J. Prabhu and J. A. C. Resing, “Markovian queues with Poisson control”, arXiv:2208.10198 (2023).

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.