By Topic

A new queue discipline for various delay and jitter requirements in real-time packet-switched networks

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

3 Author(s)
Minseok Song ; Sch. of Comput. Sci. & Eng., Seoul Nat. Univ. ; Naehyuck Chang ; Heonshik Shin

In scheduling data packets over the network, queue service disciplines are used to determine service priority, delay bound, jitter bound and bandwidth. Among them the Weighted Round Robin (WRR) technique has provided the most reasonable performance in guaranteeing both bandwidth and fairness requirements. WRR, however, fails to accommodate various end-to-end delays and jitter bounds. We propose a new WRR algorithm, called Rate-controlled Frame-based Weighted Round Robin (RFWRR) which guarantees the delay jitter bound and satisfies a diverse set of delay requirements. The proposed algorithm divides the scheduler into two components: a rate controller and a frame-based WRR server. The rate controller controls delay jitters by reshaping traffic patterns while the WRR server assigns priorities to the packets in order to meet various delay requirements. The RFWRR has a simple hardware implementation and provides a constant buffer space. We also show that it can be effectively applied to the various traffic classes of the ATM networks

Published in:

Real-Time Computing Systems and Applications, 2000. Proceedings. Seventh International Conference on

Date of Conference: