IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
| Hi-index | 0.00 |
Many router mechanisms have been developed to achieve fair bandwidth allocations.Generally, most of these mechanisms need to maintain per-flow stat and therefore are morecomplex and less scalable than simple FIFO queuing when the are used in the interior of ahigh-speed network.Consequently, design of algorithms that can provide per-flow fair ratewithout requiring per-flow functionality in the network core routers had become an active area of research.In this paper, 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 and RFQ with several different configurations and traffic sources.The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all 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.