基于Crossbar的抗突发调度算法  

Crossbar-based scheduling algorithm for burst traffic

作　　者：王鹏[1] 金德鹏[1] 曾烈光[1] 

机构地区：[1]清华大学电子工程系,北京100084

出　　处：《清华大学学报（自然科学版）》2004年第7期938-941,共4页Journal of Tsinghua University(Science and Technology)

基　　金：国家"八六三"高技术项目(2001AA121071)

摘　　要：在基于输入队列的调度算法中,iSLIP(iterativeSLIP)算法以其高速易于实现的特点在高速路由器的应用中倍受关注,但是该算法在处理突发业务时性能严重恶化。该文提出一种新型的输入排队调度算法iTFF(iterative"timetoleave"and"fullornot"first),在调度中将队头包延时与队列长度的影响综合考虑,并通过软件仿真验证了该算法在处理突发业务时的鲁棒性,其性能明显优于iSLIP算法。同时该算法的硬件实现复杂度与iSLIP算法相比增加不大,易于高速硬件实现。For input-queued scheduling, the iSLIP (iterative SLIP) algorithm provides high throughput and is easily implemented. However, with burst arrivals, its average input latency increases dramatically and many cells may be dropped as the input buffer overflows. A scheduling algorithm called iTFF (iterative 'time to leave' and 'full or not' first) was developed to reduce the cell loss rate without increasing the average input latency, which has better performance than iSLIP with burst traffic conditions. Simulation results show that the iTFF algorithm exponentially reduces the cell loss rate and yet maintains low average input latency. Moreover, iTFF can be implemented in hardware to achieve high speed.

关 键 词：计算机网络 调度 突发业务 

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