University of Maryland DRUM  
University of Maryland Digital Repository at the University of Maryland

DRUM >
Institute for Systems Research >
Institute for Systems Research Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1903/6067

Title: Balanced-RED: An Algorithm to Achieve Fairness in the Internet
Authors: Farooq M. Anjum
Tassiulas, Leandros
Advisors: Tassiulas, Leandros
Department/Program: ISR
CSHCN
Type: Technical Report
Keywords: Gateway Algorithms, Random Early Detection(RED), Intelligent Signal Processing and Communications Systems
Issue Date: 1999
Series/Report no.: ISR; TR 1999-17
CSHCN; TR 1999-9
Abstract: The problem of fair bandwidth sharing among adaptive (TCP) and non-adaptive(i.e. CBR-UDP) flows at an Internet gateway is considered. An algorithm thatdrops packet preventively, in an attempt to actively penalize the non-adaptivetraffic that attempts to "steal" buffer space, and therefore bandwidth from theadaptive traffic flows, is presented. The algorithm maintains minimal flow stateinformation and is therefore scalable. The performance of the algorithm iscompared with other gateway algorithms, and it is shown that, in the presence of non-adaptive traffic, it achieves a more balanced bandwidth allocation among thedifferent flows. The behavior of a flow subjected to the given algorithm has also been analyzed in detail.
URI: http://hdl.handle.net/1903/6067
Appears in Collections:Institute for Systems Research Technical Reports

Files in This Item:

File Description SizeFormatNo. of Downloads
TR_99-17.pdf443KbAdobe PDF65View/Open

Show full item record

All items in DRUM are protected by copyright, with all rights reserved.

 

DRUM is brought to you by the University of Maryland Libraries
University of Maryland, College Park, MD 20742-7011 (301)314-1328.
Please send us your comments.
All Contents