Portal de Periódicos da CAPES

Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers

2005; Elsevier BV; Volume: 60; Issue: 5 Linguagem: Inglês

10.1016/j.aeue.2005.04.002

1618-0399

Dirk Abendroth, Martin E. Eckel, Ulrich Killat,

Advanced Queuing Theory Analysis

In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization.