By Topic

Delay optimized worst case fair WFQ (WF2Q) packet scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fei, X. ; Sch. of Electr. & Electron. Eng., Queen''s Univ., Belfast, UK ; Marshall, A.

The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. Worst case fair WFQ (WF2Q) is better than weighted fair queuing (WFQ) in that it can provide bounded WFI. However, simulations show that in some circumstances WF2Q has higher WFI and queuing delay than WFQ. This paper firstly analyzes the reasons why WF2Q sometimes experiences higher WFI, and based on this, an adaptive packet queuing algorithm termed delay optimized WF2Q (DO-WF2Q), is proposed. This algorithm aims to improve the delay index (DI) while maintaining the WFI bound provided by WF2Q. Verifications and simulations show that DO-WF2Q can reduce DI while not destroying the WFI bound, and at the same time maintain low complexity.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:2 )

Date of Conference:

2002