By Topic

Approximating fair bandwidth allocation in core-stateless networks

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
$33 $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)
Zhai Mingyu ; Dept. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China ; Gu Guanqun

We present queue length based fair queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. Edge routers divide each flow into a set of layers using a linear encoding scheme and insert an appropriate label into each packet header. Core routers maintain a dropping threshold according to the current queue length at each router; packets with a label greater than the threshold are dropped. We have evaluated QLFQ together with CSFQ (core-stateless fair queueing) and RFQ (rainbow fair queueing) with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ. The simulations also show that in an environment with bursty traffic sources, QLFQ provides much better fairness than CSFQ.

Published in:

Networks, 2001. Proceedings. Ninth IEEE International Conference on

Date of Conference:

10-12 Oct. 2001