| dc.contributor.author | Halabian, H | |
| dc.contributor.author | Saidi, H | |
| dc.date.accessioned | 2013-08-06T06:08:04Z | |
| dc.date.available | 2013-08-06T06:08:04Z | |
| dc.date.issued | 2008 | |
| dc.identifier.citation | Halabian, H., & Saidi, H. (2008, April). FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks. In Information and Communication Technologies: From Theory to Applications, 2008. ICTTA 2008. 3rd International Conference on (pp. 1-6). IEEE. | en |
| dc.identifier.isbn | 978-1-4244-1751-3 | |
| dc.identifier.uri | http://hdl.handle.net/11295/54537 | |
| dc.description.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. | en |
| dc.language.iso | en | en |
| dc.publisher | University of Nairobi, | en |
| dc.title | FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks | en |
| dc.type | Presentation | en |
| local.publisher | College of health sciences, | en |
