文章基本信息

标题：A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity
本地全文：下载
作者：Kwak, Dong-Yong ; Ko, Nam-Seok ; Kim, Bong-Tae 等
期刊名称：ETRI Journal
印刷版ISSN：1225-6463
电子版ISSN：2233-7326
出版年度：2003
卷号：25
期号：6
页码：475-475
语种：English
出版社：Electronics and Telecommunications Research Institute
摘要：In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.
关键词：Fair queuing;packet scheduling algorithm;WFQ