Sciweavers

Share
NOSSDAV
2004
Springer

Reduced state fair queuing for edge and core routers

9 years 3 months ago
Reduced state fair queuing for edge and core routers
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the state needs for even simple schedulers are still large for heavily channelized core routers and for edge routers. An earlier proposal, Stochastic Fair Queuing, reduces state but at the expense of added unfairness between certain flows. Another earlier scheme, Core Stateless Fair Queuing, requires header changes and does not address the state needs of edge routers. By contrast, our paper proposes a randomization technique that removes the need to store deficit counters per flow in Deficit Round Robin and its variants. Even without the counters, we show, using both analysis and simulation, that randomized technique preserves throughput fairness properties of DRR. This randomization technique introduced in this paper can be used to considerably reduce the state requirements of high speed schedulers in edge and...
Ramana Rao Kompella, George Varghese
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where NOSSDAV
Authors Ramana Rao Kompella, George Varghese
Comments (0)
books