By Topic

A new RPR fairness algorithm based on deficit round robin scheduling algorithm

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

4 Author(s)
Hongbo Fang ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Peng Wang ; Depeng Jin ; Lieguang Zeng

Resilient packet ring (RPR) is a new kind of metropolitan area network technology which has a fast automatic protection switching ability. Fairness algorithm is a key technology of RPR. Current fairness algorithms cannot get high bandwidth utilization and suffer from permanent oscillations under unbalanced conditions. A new fairness algorithm based on deficit round robin (FBDRR) is presented. Its ideal model, based on the GPS (generalized processor sharing) scheduling algorithm, is proved to be RIAS (ring ingress aggregated with spatial reuse) fair. Analysis and simulations prove that FBDRR can solve the oscillation problems, allocate bandwidth fairly and converge very quickly.

Published in:

Communications, Circuits and Systems, 2004. ICCCAS 2004. 2004 International Conference on  (Volume:1 )

Date of Conference:

27-29 June 2004