A two-queue finite-buffer polling model with limited service and state-dependent service times

We analyze a single server polling model with two finite buffer queues (high and low priority queues), in which high-priority queue is served with queue length dependent service intervals, while low-priority queue is served with constant service intervals. The server follows limited service discipline to serve packets from both the queues. We derive buffer occupancy distribution of high priority queue at departure instants by using embedded Markov chain approach. Simulation results confirm the validity of analytical results. This polling model can be used to model and analyze any node in a packet-switched network, which handles both real-time and non real-time traffic. © 2014 IEEE.