2RegionRED: a Congestion Control Mechanism for the High Speed Internet
This thesis proposes a new Active Queue Management (AQM) scheme called 2RegionRED. It is superior to the classic Random Early Detection (RED) algorithm in that there is an intuitive way to set its parameters and it is self-tuning. Its design is motivated by an original principle to sustain the sma...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149932 |
| _version_ | 1811085377704820736 |
|---|---|
| author | Wang, Karen |
| author_facet | Wang, Karen |
| author_sort | Wang, Karen |
| collection | MIT |
| description | This thesis proposes a new Active Queue Management (AQM) scheme called 2RegionRED. It is superior to the classic Random Early Detection (RED) algorithm in that there is an intuitive way to set its parameters and it is self-tuning. Its design is motivated by an original principle to sustain the smallest queue possible while still allowing for maximum link utilization. 2RegionRED uses the number of competing TCPs as its measure of load. However it does not keep an explicit count. The result is a novel algorithm that adjusts the drop rate according to two regions of operation: that requiring less than and greater than one drop per round-trip time (RTT). This thesis also analyzes methods for measuring the persistent queue and proposes the ABSMIN method. Simulations of 2RegionRED using ABSMIN reveal some difficulties and insights. Basic comparisons to the Adaptive RED and Flow Proportional Queuing (FPQ) adaptive algorithms are also demonstrated through simulation |
| first_indexed | 2024-09-23T13:08:37Z |
| id | mit-1721.1/149932 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T13:08:37Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1499322023-03-30T03:40:53Z 2RegionRED: a Congestion Control Mechanism for the High Speed Internet Wang, Karen This thesis proposes a new Active Queue Management (AQM) scheme called 2RegionRED. It is superior to the classic Random Early Detection (RED) algorithm in that there is an intuitive way to set its parameters and it is self-tuning. Its design is motivated by an original principle to sustain the smallest queue possible while still allowing for maximum link utilization. 2RegionRED uses the number of competing TCPs as its measure of load. However it does not keep an explicit count. The result is a novel algorithm that adjusts the drop rate according to two regions of operation: that requiring less than and greater than one drop per round-trip time (RTT). This thesis also analyzes methods for measuring the persistent queue and proposes the ABSMIN method. Simulations of 2RegionRED using ABSMIN reveal some difficulties and insights. Basic comparisons to the Adaptive RED and Flow Proportional Queuing (FPQ) adaptive algorithms are also demonstrated through simulation 2023-03-29T15:34:42Z 2023-03-29T15:34:42Z 2001-12 https://hdl.handle.net/1721.1/149932 MIT-LCS-TR-829 application/pdf |
| spellingShingle | Wang, Karen 2RegionRED: a Congestion Control Mechanism for the High Speed Internet |
| title | 2RegionRED: a Congestion Control Mechanism for the High Speed Internet |
| title_full | 2RegionRED: a Congestion Control Mechanism for the High Speed Internet |
| title_fullStr | 2RegionRED: a Congestion Control Mechanism for the High Speed Internet |
| title_full_unstemmed | 2RegionRED: a Congestion Control Mechanism for the High Speed Internet |
| title_short | 2RegionRED: a Congestion Control Mechanism for the High Speed Internet |
| title_sort | 2regionred a congestion control mechanism for the high speed internet |
| url | https://hdl.handle.net/1721.1/149932 |
| work_keys_str_mv | AT wangkaren 2regionredacongestioncontrolmechanismforthehighspeedinternet |