FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks

Author

Halabian, Hassan ; Saidi, Hossein

Author_Institution

Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan

fYear

2008

Firstpage

1

Lastpage

6

Abstract

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.

Keywords

broadband networks; computational complexity; queueing theory; scheduling; telecommunication traffic; FPFQ algorithm; RPS model; broadband networks; low complexity fair queueing algorithm; system potential function complexity; traffic scheduling algorithm; Broadband communication; Clocks; Computer networks; Delay effects; Finishing; Scheduling algorithm; Sorting; Telecommunication traffic; Traffic control; Virtual colonoscopy; Fair queueing algorithms; Rate proportional servers;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on

Conference_Location

Damascus

Print_ISBN

978-1-4244-1751-3

Electronic_ISBN

978-1-4244-1752-0

Type

conf

DOI

10.1109/ICTTA.2008.4530209

Filename

4530209