高速信元交换调度算法研究

Study of Scheduling Algorithms for High Bandwidth Cell Switches

输入缓存交换结构的特点是缓存器和交换结构的运行速率与端口速率相等、实现容易 ,但存在队头阻塞 (HOL) ,其吞吐率只有约 5 8% .采用虚拟输出排队方法 (VOQ)和适当的信元调度算法可消除HOL ,使吞吐率达到10 0 % .本文通过仿真对几种调度算法 :PIM、iSLIP和LPF进行了全面地研究、比较和评价 .

Input queued cell switch has the advantage of same bandwidth of buffer and switching architecture as that of inputs and outputs.But the head of line blocking in input queued switch limits its throughput to approximately 58%.If VOQ queueing policies are used with some cell scheduling algorithms,the 100% throughput can be achieved.This paper quantitatively evaluates and compares the performance of three scheduling algorithms:PIM,iSLIP and LPF.