By Topic

A new scalable and efficient packet scheduling method in high-speed packet switch 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

1 Author(s)
Cheng Shan ; Dept. of Comput. Sci. & Eng., Southern Methodist Univ., Dallas, TX, USA

While weighted fair queueing (WFQ) and many other fair scheduling methods can provide guaranteed worst case delay bounds, they are not scalable to a large number of connections due to per-flow queuing. This paper presents a new packet scheduling method-round-robin priority queuing (RRPQ). RRPQ guarantees a per-session-based delay bound without per-flow queuing. It also avoids many other implementation complexities in fair queuing scheduling. The scalability and low implementation cost of RRPQ make it a practical solution in providing guaranteed delay bounds in high-speed networks

Published in:

High Performance Switching and Routing, 2001 IEEE Workshop on

Date of Conference:

2001