By Topic

A simple and effective scheduling mechanism using minimized cycle round robin

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
$33 $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)
Yao Liang ; Bradley Dept. of Electr. & Comput. Eng., Virginia Polytech. Inst. & State Univ., Alexandria, VA, USA

In this paper, we first present a simple scheduling scheme called minimized cycle round robin (MCRR) for packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large number of connections. HMCRR can significantly improve router/switch scheduling latency and hence the delay and delay jitter performance, while keeping the simplicity of WRR based scheduling disciplines.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:4 )

Date of Conference:

2002