FPFQ:一种用于宽带网络的低复杂度公平排队算法

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications Pub Date : 2008-04-07 DOI:10.1109/ICTTA.2008.4530209

H. Halabian, H. Saidi

{"title":"FPFQ:一种用于宽带网络的低复杂度公平排队算法","authors":"H. Halabian, H. Saidi","doi":"10.1109/ICTTA.2008.4530209","DOIUrl":null,"url":null,"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.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks\",\"authors\":\"H. Halabian, H. Saidi\",\"doi\":\"10.1109/ICTTA.2008.4530209\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":330215,\"journal\":{\"name\":\"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTTA.2008.4530209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTTA.2008.4530209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

提出了一种基于RPS模型的交通调度算法FPFQ。在FPFQ中，利用精加工电位排序算法的结果对系统电位函数进行重新标定。这将系统的潜在函数复杂度降低到0 (l)，而其公平性指数仍可与SFPQ和WFQ相媲美。利用分析方法从延迟界和公平性指标两方面证明了FPFQ的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

FPFQ: A Low Complexity Fair Queueing Algorithm for Broadband Networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量