一种具有低时延的分组公平循环调度.pdfVIP

第 29 卷第 4 期 电 子 与 信 息 学 报 Vol.29No.4 2007 年4 月 Journal of Electronics Information Technology Apr. 2007 一种具有低时延的分组公平循环调度 杨 帆 刘增基 邱智亮 刘焕峰 (西安电子科技大学综合业务网国家重点实验室 西安 710071) 摘 要：本文提出了一种新的分组循环调度算法LFRR(Large weight First Round Robin)。为了具有良好的时延 特性和较低的实现复杂度，LFRR 采取了以下方法：(1)在调度表中为流分配时隙时，LFRR 以时隙完全均匀分布 为参照，确保分配给一个流的时隙不会过早或过晚地出现在调度表中。(2)LFRR 算法中采用了等权值流合并的技 术，把权值大于 1 且权值相等的流合并成一个虚流，以虚流为处理对象，使算法需要处理的对象数目大为减小。(3) 当一个时隙适合分配给多个虚流时，LFRR 采用了简单的权值大的虚流优先占用时隙的原则。本文对 LFRR 进行 了理论分析和计算机仿真，结果表明 LFRR 算法的时延性能比 WRR(Weighted Round Robin)有了很大提高，同 时 LFRR 算法的公平性也有保证。 关键词：分组调度；时延；实现复杂度；公平性 中图分类号：TP393 文献标识码：A 文章编号：1009-5896(2007)04-0785-04 A Fair Round Robin Scheduling Algorithm with Low Latency Yang Fan Liu Zeng-ji Qiu Zhi-liang Liu Huan-feng (The National Key Lab of ISN, Xidian University, Xi’an 710071, China) Abstract: A new round robin scheduling algorithm named LFRR(Large weight First Round Robin) is proposed in this paper. In order to achieve good delay property and low implementation complexity, several methods are taken in LFRR. Firstly, when slots are allocated for flows in the schedule table, LFRR refers to the ideal situation where the slots of each flow are uniformly distributed in the schedule table to prevent flows’ slots from appearing too early or too late. Secondly, in LFRR system flows which weights are the same and larger than 1 are aggregated into a virtual flow. LFRR deals with virtual flows instead of actual flows. This deceases the flow number that scheduling algorithm deals with. Thirdly, when a slot can be allocated to several virtual flows, flows with larger weight have high priority to po