Heavy-traffic asymptotics of a priority polling system with threshold service policy

From MaRDI portal
Publication:342103

DOI10.1016/J.COR.2015.06.013zbMATH Open1349.90225arXiv1408.4192OpenAlexW1591144521MaRDI QIDQ342103FDOQ342103

Yuqing Chu, Jinbiao Wu, Zaiming Liu

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Abstract: In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the critically loaded queue is exponentially distributed, independent of that of the stable queues. In addition, the queue lengths of stable queues possess the same distributions as a priority polling system with N-policy vacation. Based on this fact, we provide the exact tail asymptotics of the vacation polling system to approximate the tail distribution of the queue lengths of the stable queues, which shows that it has the same prefactors and decay rates as the classical M/M/1 preemptive priority queues. Finally, a stochastic simulation is taken to test the results aforementioned.


Full work available at URL: https://arxiv.org/abs/1408.4192




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Heavy-traffic asymptotics of a priority polling system with threshold service policy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342103)