论文部分内容阅读
为了提高数据通信的传输速率和可靠性,高速路由器和交换机采用了基于crossbar的交换结构以及多种调度算法。首先对经典的集中式调度算法iSLIP算法进行分析,由于此算法在突发和不均匀业务时的性能有很大的下降。针对这一缺陷,提出了lp_iSLIP(Long Queues Priority iSLIP)算法,此算法在突发业务时表现出比iSLIP算法更好的性能,在均匀业务时的性能与iSLIP算法相当,而且没有增加硬件实现的复杂度。
In order to improve data transmission rate and reliability, high-speed routers and switches using crossbar-based switching fabric and a variety of scheduling algorithms. First of all, the classic centralized scheduling algorithm iSLIP algorithm is analyzed, because of the performance of the algorithm in the burst and uneven service has greatly decreased. In response to this flaw, this paper proposes a Long Queues Priority iSLIP (lp_iSLIP) algorithm which shows better performance than iSLIP algorithm in burst traffic and has the same performance as iSLIP algorithm in uniform traffic without any increase of hardware implementation the complexity.