Large deviations of Markovian polling models with applications to admission control

In this paper we consider large deviations and admission control problems for a discrete-time Markovian polling system. The system consists of two-parallel queues and multiple heterogeneous servers. The arrival process of each queue is a superposition of mutually independent Markovian on/off processes, and the multiple servers serve independently the two queues according to the so-called Bernoulli service schedule. Using the large deviations techniques, we derive upper and lower bounds of the overflow probabilities, and then we present an admission control criterion by which different Quality of Service (QoS) requirements for the two queues are guaranteed.