论文部分内容阅读
在基于输入队列的调度算法中,iSLIP(iterativeSLIP)算法以其高速易于实现的特点在高速路由器的应用中倍受关注,但是该算法在处理突发业务时性能严重恶化。该文提出一种新型的输入排队调度算法iTFF(iterative“timetoleave”and“fullornot”first),在调度中将队头包延时与队列长度的影响综合考虑,并通过软件仿真验证了该算法在处理突发业务时的鲁棒性,其性能明显优于iSLIP算法。同时该算法的硬件实现复杂度与iSLIP算法相比增加不大,易于高速硬件实现。
In the input queue-based scheduling algorithm, the iterativeSLIP algorithm attracts much attention in the application of high-speed routers for its high-speed and easy-to-implement characteristics. However, the performance of the algorithm is seriously deteriorated in the case of handling sudden traffic. In this paper, a new type of input queue scheduling algorithm iTFF (iterative “timetoleave” and “fullornot ” first) is proposed, which considers the influence of queue head packet delay and queue length in scheduling and verifies by software simulation The robustness of the algorithm when dealing with burst services is significantly better than the iSLIP algorithm. At the same time, the complexity of hardware implementation of the algorithm is not increased compared with iSLIP algorithm, which is easy to realize high-speed hardware.