Approximate fair bandwidth allocation using multi-thresholds rate partitioning scheme

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication4th National Conference on Telecommunication Technology, NCTT 2003 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages8-12
Number of pages5
ISBN (Electronic)0780377737, 9780780377738
DOIs
StatePublished - 2003
Externally publishedYes
Event4th National Conference on Telecommunication Technology, NCTT 2003 - Shah Alam, Malaysia
Duration: 14 Jan 200315 Jan 2003

Publication series

Name4th National Conference on Telecommunication Technology, NCTT 2003 - Proceedings

Conference

Conference4th National Conference on Telecommunication Technology, NCTT 2003
Country/TerritoryMalaysia
CityShah Alam
Period14/01/0315/01/03

Keywords

  • Bandwidth
  • Channel allocation
  • Counting circuits
  • Inductors
  • Partitioning algorithms
  • Protection
  • Round robin
  • Stochastic processes
  • Streaming media
  • Traffic control

Fingerprint

Dive into the research topics of 'Approximate fair bandwidth allocation using multi-thresholds rate partitioning scheme'. Together they form a unique fingerprint.

Cite this