Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers |
| |
Authors: | Dirk Abendroth Martin E Eckel Ulrich Killat |
| |
Affiliation: | aResearch and Innovation Center BMW, Munich, Germany;bWerner und Martin Eckel GbR, Germany;cCommunication Networks Department, Technical University, Hamburg-Harburg, Germany |
| |
Abstract: | 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. |
| |
Keywords: | Weighted fair queueing Fairness Service separation Leaky bucket Token bucket |
本文献已被 ScienceDirect 等数据库收录! |