并行分布式变长分组调度算法PDMCRR

Variable-length packet scheduling algorithm PDMCRR

低复杂度和良好公平性是T比特级网络节点调度算法设计中的挑战,通过引入端口间的并行机制和单端口的流水线思想,提出了一种可以满足T比特级网络节点调度需求、具有低复杂度和良好公平性的变长分组调度算法———并行分布式改进补偿调度算法(pipleline distributed modified compensating round robin,PDMCRR)。通过理论分析和计算机仿真验证了该算法的性能。

Low complexity and good fairness are great challenges in scheduling algorithm design for terabit router, and they often conflict with each other. By introducing parallelism among input ports and pipdine per-port mechamisms to CRR scheduling algorithm, a novel scheduling algofithm--pipleline distributed modified compensating round robin （PDMCRR） for terabit muter is presented. The analysis and simulation results show that the PDMCRR can not only deal with varible-length packet, but also has low complexity and good fairness performance.