Balanced-RED: An Algorithm to Achieve Fairness in the Internet
| dc.contributor.advisor | Tassiulas, Leandros | en_US |
| dc.contributor.author | Farooq M. Anjum | en_US |
| dc.contributor.author | Tassiulas, Leandros | en_US |
| dc.contributor.department | ISR | en_US |
| dc.contributor.department | CSHCN | en_US |
| dc.date.accessioned | 2007-05-23T10:08:05Z | |
| dc.date.available | 2007-05-23T10:08:05Z | |
| dc.date.issued | 1999 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 453756 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/6067 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1999-17 | en_US |
| dc.relation.ispartofseries | CSHCN; TR 1999-9 | en_US |
| dc.subject | Gateway Algorithms | en_US |
| dc.subject | Random Early Detection(RED) | en_US |
| dc.subject | Intelligent Signal Processing and Communications Systems | en_US |
| dc.title | Balanced-RED: An Algorithm to Achieve Fairness in the Internet | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1