By Topic

DBSW packet scheduling algorithm for multimedia service

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Kyung Taek Chung ; Sch. of Electron. & Inf. Eng., Kunsan Nat. Univ., South Korea ; Hyun Park ; Jeoung Woo Choi ; Hae Seong Cho
more authors

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

Published in:

TENCON 2001. Proceedings of IEEE Region 10 International Conference on Electrical and Electronic Technology  (Volume:1 )

Date of Conference:

2001