Fair bandwidth allocations through queue management in core-stateless networks

We present queue length based fair queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ (core-stateless fair queueing) (see Stoica, I., Proc. ACM SIGCOMM´98, p.119-30, 1998) and RFQ (rainbow fair queueing) (see Cao, Z., Proc. IEEE Infocom, 2000) 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