%0 Journal Article
%T A Round-Robin Scheduling Algorithm by Iterating Between Slots for Input- Queued Switches<br>时隙间迭代的输入队列交换机Round-Robin调度算法
%A WU Jun
%A CHEN Qing
%A LUO Jun-Zhou
%A <br>吴俊
%A 陈晴
%A 罗军舟
%J 软件学报
%D 2005
%I 
%X 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.
%K switch
%K input-queueing
%K Round-Robin
%K throughput<br>交换机
%K 输入队列
%K Round-Robin
%K 吞吐率
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0A6D4197928E3434&yid=2DD7160C83D0ACED&vid=7801E6FC5AE9020C&iid=38B194292C032A66&sid=315A3D008C6ECFC8&eid=663FF78B2ADE7A2D&journal_id=1000-9825&journal_name=软件学报&referenced_num=6&reference_num=16