DBSW packet scheduling algorithm for multimedia service

In order to satisfy QoS requirements of various applications such as audio, video, ftp, etc., switching nodes of the networks must control the use of network resources by properly scheduling them. The scheduling algorithms provide the bandwidth guarantees for each connection with bounded packet delay if the source conforms to a certain traffic specification. We propose the dynamic binary scheduling wheel (DBSW) scheme, which can execute the WRR scheduling algorithm efficiently, to improve the problems in the binary scheduling wheel (BSW) scheme. Also, we develop a packet scheduling algorithm which is suitable for the DBSW scheme. The proposed DBSW scheme and the developed algorithm are capable of decreasing average cell delay and maximum queue length by serving other VC cells when the selected VC queue is empty. The evaluation results show that the proposed scheme can implement the WRR algorithm efficiently.