论文部分内容阅读
为了提高数据通信的传输速率与可靠性,高速路由器采用了基于VOQ的交换架构及调度算法。首先对经典的FIRM(FCFS in Round-Robin Matching)算法进行分析,该算法在突发和非均匀业务时性能有很大的下降。针对这一缺陷,提出了lp-FIRM(Long Queues Priority FIRM)算法,此算法采用长队列有效机制,对VOQ队列长度超过阈值Lmax的队列首先进行循环匹配调度,再对长度小于阈值Lmax的队列进行循环匹配调度,并给出了lp-FIRM的算法描述,并与i SLIP、FIRM算法进行了比较。仿真结果表明,lp-FIRM算法与经典算法相比,在均匀业务下的性能类似,而在非均匀业务下性能有了很大提升。
In order to improve the data communication transmission rate and reliability, high-speed routers using VOQ-based switching architecture and scheduling algorithm. First of all, the classical FIRM (FCFS in Round-Robin Matching) algorithm is analyzed, the performance of the algorithm in the burst and non-uniform business has greatly decreased. In order to solve this problem, this paper proposes a Long Queues Priority FIR (lp-FIRM) algorithm. This algorithm uses a long-queue efficient mechanism to schedule the queues with the VOQ queue length above the threshold Lmax first and then to the queue with the length less than the threshold Lmax Loop matching scheduling, and gives the lp-FIRM algorithm description and compared with i SLIP, FIRM algorithm. Simulation results show that the performance of lp-FIRM algorithm is similar to that of the classical algorithm under uniform traffic, and the performance of lp-FIRM algorithm is greatly improved under the non-uniform traffic.