Analysis of a Polling System Modeling QoS Differentiation in WLANs

Abstract

This paper investigates a polling system with a random polling scheme, a 1-limited service discipline and deterministic service requirement modeling WLANs with QoS differentation capability. The system contains high and low priority queues that are distinguished via the probability of being served next. We propose a new iteration algorithm to approximate the waiting time of customers in the high and low priority queues. As shown by simulation results, our approximation is accurate for light to moderately loaded networks.