一种支持单播与组播混合业务的高速Crossbar调度算法  

A New Scheduling Algorithm Supporting Unicast and Multicast Traffic for High-speed Crossbars

作　　者：戴精科[1] 彭来献[1] 张邦宁[1] 

机构地区：[1]解放军理工大学通信工程学院,南京210007

出　　处：《电子与信息学报》2009年第10期2299-2304,共6页Journal of Electronics & Information Technology

基　　金：江苏省自然科学基金(BK2007001)资助课题

摘　　要：当前在高速crossbar中支持单、组播混合业务调度的实用算法一般采用"请求-许可-接受"的处理流程(例如ESLIP算法)。研究发现,该类算法中存在单、组播"许可"相互阻塞现象,造成调度效率降低。从实用性出发,该文提出了一种新的支持单、组播混合业务的调度算法-——ERGRR(Extended Request-Grant-based Round-Robin),通过简化调度处理流程,克服了"许可"阻塞现象,提高了系统吞吐量、时延等性能。仿真结果表明,在单、组播混合业务流下,ERGRR算法吞吐量、时延等性能优于ESLIP算法。另外,ERGRR算法具有更好的公平性以及更加易于硬件实现。The current practical scheduling algorithms supporting unicast and multicast traffic in high-speed crossbars are generally based on a request-grant-accept process, such as ESLIP. But there is a phenomenon called ＂Grant＂ blocking between unicast and multicast cells in this kind of algorithms, which decreases the scheduling efficiency. According to the practicability, this paper presents a new algorithm supporting unicast and multicast traffic--ERGRR （Extended Request-Grant-based Round-Robin）. ERGRR overcomes the ＂Grant＂ blocking and improves the system performance, such as throughput and delay, by simplifying execution process. The simulation results show that the ERGRR can achieve better performance of throughput and delay than ESLIP under various unicast and multicast traffics. In addition, ERGRR provides better fairness and its implementation complexity is lower than ESLIP.

关 键 词：路由器 输入排队 CROSSBAR 组播 ERGRR 

分 类 号：TP393.05[自动化与计算机技术—计算机应用技术]