Class-based weighted fair queuing scheduling on dual-priority delta networks

Contemporary networks accommodate handling of multiple priorities,aiming to provide suitable qos levels to different traffic classes. in the presence of multiple priorities,a scheduling algorithm is employed to select each time the next packet to transmit over the data link. class-based weighted fair queuing (cbwfq) scheduling and its variations is widely used as a scheduling technique,since it is easy to implement and prevents the low-priority queues from being completely neglected during periods of high-priority traffic. by using this scheduling,low-priority queues have the opportunity to transmit packets even though the high-priority queues are not empty. in this work,the modeling,analysis and performance evaluation of a single-buffered,dual-priority multistage interconnection network (min) operating under the cbwfq scheduling policy is presented. performance evaluation is conducted through simulation,and the performance measures obtained can be valuable assets for min designers,in order to minimize the overall deployment costs and delivering efficient systems. © copyright 2012 d. c. vasiliadis et al.