Busy-probability comparison between the true system and mean-field approximations
Busy-probability comparison between the true system and mean-field approximations
Let
. Denote by , , and the stationary busy probabilities of the original system and the Mean-Field 1 and Mean-Field 2 approximations, respectively.
Mean-field busy-probability comparison. For ,
Thus Mean-Field 1 overestimates the stationary busy probability, whereas Mean-Field 2 underestimates it. The comparison quantifies the relative congestion predicted by the two approximations, but the supplied text does not establish whether the claim is proved or remains conjectural.
Sources & referencesView supporting material
Primary source
Philippe Sarotte, Nahuel Soprano-Loto and François Baccelli, “Interference Queueing Networks: A Replica Mean-Field Approach in the Symmetric Setting”, arXiv:2606.13264 (2026).
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.