时隙间迭代的输入队列交换机Round-Robin调度算法  

A Round-Robin Scheduling Algorithm by Iterating Between Slots for Input- Queued Switches

作　　者：吴俊[1] 陈晴[1] 罗军舟[1] 

机构地区：[1]东南大学计算机科学与工程系网络室,江苏南京210096

出　　处：《软件学报》2005年第3期375-383,共9页Journal of Software

基　　金：国家自然科学基金;国家重点基础研究发展规划(973);高等学校博士学科点专项科研基金;江苏省网络与信息安全重点实验室资助;东南大学优秀博士论文基金~~

摘　　要：输入队列因具有良好的可扩展性而广泛应用于高速交换机和路由器中,但输入队列需要精心设计调度算法以获取较好的性能.Round-Robin 算法因其简单性和并行性而得到广泛的研究,但现有的 Round-Robin 算法在突发流量和非均匀流量下的负荷-延迟性能较差.提出了调度决策在时隙间进行迭代的思想,并利用队列长度具有随机性的特点设计了能近似最大匹配的 Round-Robin 算法——iSLOT.仿真结果表明,iSLOT 不仅在均匀流量下是稳定的,在非均匀流量和突发流量下的吞吐率及延迟性能均远好于现有的 Round-Robin 算法.Input-Queueing is becoming increasingly used for high-bandwidth switches and routers for its scalability, but it needs an elaborate scheduling algorithm to achieve good performance. Round-Robin algorithms have been extensively investigated due to its simplicity and parallelism. However, the present Round-Robin algorithms suffer from poor performance under nonuniform and burst traffic. This paper proposes a Round-Robin algorithm named iSLOT, which can approximate the maximum matching algorithms by iterating the scheduling decision between slots and using the randomness of the queue length. Simulation results show that iSLOT not only is stable under uniform i.i.d traffics, but also outperforms the existing round-robin algorithms under burst and nonuniform traffics in throughput and delay performance.

关 键 词：交换机 输入队列 Round-Robin 吞吐率 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]