FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks

被引:0
|
作者
Halabian, Hassan [1 ]
Saidi, Hossein [1 ]
机构
[1] Isfahan Univ Technol, Dept Elect & Comp Engn, Esfahan 8415683111, Iran
关键词
Fair queueing algorithms; Rate proportional servers;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A traffic scheduling algorithm based on the RPS model called FPFQ is proposed. In FPFQ, the result of finishing potentials sorting algorithm is used for recalibration of the system potential function. This reduces the system potential function complexity to O(l) while its fairness index is still comparable to that of SFPQ and WFQ. Analytical methods are invoked to show the effectiveness of FPFQ in terms of Delay bound and fairness index.
引用
收藏
页码:2186 / 2191
页数:6
相关论文
共 50 条