کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
449813 1443251 2006 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: AEU - International Journal of Electronics and Communications - Volume 60, Issue 5, 2 May 2006, Pages 404–407
نویسندگان
, , ,