期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2012
卷号：2
期号：10
出版社：S.S. Mishra
摘要：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 p ackets. Among many packet scheduling techniques proposed for this problem, Weighted Fair Queuing Techniques (WFQ)offers the best delay and fairness guarantees. Mo reover, 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. The other contribution of this paper is a Minimum Weighted Queuing (Minimum- WFQ) techniques which is a linear O (1) algorithm for implementing WFQ techniques. In addition the paper represents several performance studies demonstrating the power of the proposed techniques in providing precise delay bound to a large number of sessions with diverse QoS requirements.
