摘要： 通过引入分布式思想对CRR 调度算法进行改进，提出了一种基于输入排队VOQ 结构的输入端口轮转和输出端口轮询的顺序分布式改进补偿轮询调度算法SDMCRR。并通过分析以及和其它轮询算法的比较，得出该算法具有单个报文调度O(1)的复杂度、较好的隔离恶意流的公平性和时延特性。
关键词:
变长分组；补偿轮询调度算法；分布式；顺序分布式改进补偿调度算法
Abstract: In order to deal with the Terabit router high speed scheduling, the distributed idea is introduced to CRR scheduling algorithm. A novel scheduling algorithm, named sequential distributed modified compensating round robin(SDMCRR), is proposed, which cycles the input port pointer sequential and rotates the output pointer in round robin manner. The O(1) complexity for per-packet scheduling, good fairness and delay property of SDMCRR are verified with analysis and computer simulation
Key words:
Variable-length packet; Compensation round robin (CRR); Distributed; SDMCRR
刘勤让，邬江兴，兰巨龙. 顺序分布式变长分组调度算法：SDMCRR[J]. 计算机工程, 2006, 32(7): 103-105.
LIU Qinrang, WU Jiangxing, LAN Julong. Sequential Distributed Variable-length Packet Scheduling Algorithm: SDMCRR[J]. Computer Engineering, 2006, 32(7): 103-105.