On Borrow & Return-WRR Scheduling Algorithm in PFTS
Jun Dou · Journal of Sichuan University · 2005
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.