By Topic

Approximate fair bandwidth allocation using multi-thresholds rate partitioning scheme

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

2 Author(s)
Liew, H.S. ; Fac. of Eng. & Technol., Multimedia Univ., Melaka, Malaysia ; Abdelrahman, A.M.

Per-flow queueing and dropping disciplines protect well-behaved flows from misbehaving ones to achieve fair bandwidth allocation. These mechanisms involve more complicated implementations. While FIFO scheduling is simple, it does not provide flow protection. We propose a multi-thresholds rate partitioning (MTRP) algorithm to reduce complexity and to approximate fair bandwidth sharing. It divides the output link of a router into partitions; each has packet counters with predefined thresholds. Counters and thresholds are defined to penalize misbehaving flows by discarding packets. Simulations were carried out under different link and traffic environments, where MTRP has shown very promising results.

Published in:

Telecommunication Technology, 2003. NCTT 2003 Proceedings. 4th National Conference on

Date of Conference:

14-15 Jan. 2003