Approximating fair bandwidth allocation in core-stateless networks

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 th...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhai Mingyu, Gu Guanqun
Format: Conference Proceeding
Language:English
Subjects:
Bandwidth
Channel allocation
Computer networks
Computer science
Encoding
Intelligent networks
Laboratories
Scalability
Scheduling algorithm
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1531-2216
2332-5798
DOI:10.1109/ICON.2001.962384