The Exact Analysis of Limited Service Polling Systems Combined with Non-preemptive Priority Scheduling under Self-similar Traffic Input

Abstract

The cyclic execution of several multi-typed queues through a unified server requires superlative tactics of polling strategies. Further, a number of traditional scheduling schemes have been put forward to provide assured Quality of Service (QoS) to the end-user. In the prior work, no effort has been put to combine the traditional scheduling schemes with polling mechanisms. Moreover, in the prior work, the researchers have utilized traditional Poisson distribution to analyze a variety of polling mechanisms to offer the standardized QoS to the end user. However, it has been proven through numerous studies that traffic carried by internet is self-similar and unfortunately, the traditional Poisson models are unable to capture the bursty nature of internet traffic. To overcome the limitations of prior work, in the present study, we combine the limited service polling model with traditional non-preemptive scheduling scheme in two different ways. We build an analytical framework considering multiple classes of self-similar traffic and analyze their behavior on the basis of G/M/1 queuing system. We construct the Markov chain for G/M/1 queuing system and present the closed form expressions of packet latencies for related traffic classes. Simulated experiments in C++ were performed to test our proposed analytical framework for evaluating the QoS parameters and Markov chain transformation. This study clearly indicates that the combination of traditional polling mechanism with common scheduling scheme such as priority can offer a differential treatment to facilitate the required QoS for latest 4G wireless network applications according to their requirement.