Enhancing QoS by Using Weighted Fair Queuing Techniques
Must applications in communications and Virtual Private Networks, (VPNs) require data networks to provide Quality-of-Service (QoS) guarantees, such as delay and jitter bounds to individual Network flows, providing such guarantees can be achieved by the link scheduling techniques along the path of these packets. Among many packet scheduling techniques proposed for this problem, Weighted Fair Queuing Techniques (WFQ)offers the best delay and fairness guarantees. Moreover, all previous work on WFQ has been focused on developing inefficient approximations of the scheduler because of perceived scalability problems in the WFQ computation. This work proves that the previously well accepted O (N) time-complexity for WFQ implementation, where N is the number of active flows handled by the scheduler, is not true.