PFTS交换中借还-加权轮询调度算法  

On Borrow & Return-WRR Scheduling Algorithm in PFTS

作　　者：许登元[1] 刘文杰[1] 窦军[1] 

机构地区：[1]西南交通大学计算机与通信工程学院,成都610031

出　　处：《四川大学学报（自然科学版）》2005年第5期921-924,共4页Journal of Sichuan University(Natural Science Edition)

基　　金：国家自然科学基金(60372065);西南交通大学博士生创新基金

摘　　要：针对PFTS交换节点的输入端口多优先级队列环境,提出了带有“借还”思想的加权轮询调度算法BR-WRR(Borrow&Return Weighted Round Robin).对现有的WRR调度算法进行了扩展,提出了BR-WRR调度算法.仿真结果表明BR-WRR调度算法对于高优先级Burst业务,在传输时延、传输抖动、Burst各帧的保序性等方面,均优于WRR调度算法,同时又在一定程度上保证了各优先级队列调度上的公平性.Authors proposed a Borrow ＆ Return Weighted Round Robin （BR-WRR） algorithm of input scheduling and dispatching in a multiple-priority queue environment in PFTS nodes. In such nodes, there are multi-ports in a DWDM-based PFTS node and each port contains multi-lambdas. Furthermore, multiple queues with different priorities including Burst in the highest priority are devised for each input lambda. A Borrow-and-Return mechanism is introduced to improve the orthodox WRR in PFTS, which cannot satisfy continuous transmitting privileged data of a Burst to maintain its integrity. Comparison of the results between simulation of BR-WRR and that of WRR is provided and shows that BR-WRR has better performance with regard to fairness and important QoS parameters such as transit delay, jitters, and non-disordering.

关 键 词：物理帧时槽交换 突发数据块 加权轮询调度算法 借还-加权轮询调度算法 

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