An Analytical Model of Deficit Round Robin Scheduling Mechanism under Self-Similar Traffic

The provisioning of fairness among various networking and communication applications is an important quality-of-service (QoS) demand and becomes a challenging research topic. Deficit Round Robin (DRR) is a promising fair scheduling mechanism owing to its low complexity and excellent ability of achieving a good degree of fairness in terms of throughput. Although self-similar traffic has been found to exist in multimedia communication networks and has a great impact on the performance of scheduling mechanisms, there has not been any analytical model reported in the open literature for DRR in the presence of self-similar traffic. To fill this gap, we analytically investigate the queueing performance of DRR scheduling mechanism and develop a new analytical model for deriving the upper and lower bounds of the queue length distributions of individual traffic flows in DRR systems under self-similar traffic. Extensive comparison between the simulation and analytical results validates the accuracy of the developed model.