Trade-off queuing delay and link utilization for solving bufferbloat
To solve the bufferbloat problem, active queue management (AQM) has been recommended but existing AQM algorithms suffer from poor adaptability to dynamic traffics. We develop a novel adaptive AQM algorithm named TODU for a better Trade-Off between queuing Delay and link Utilization. TODU aims to mai...
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Elsevier
2020-12-01
|
| سلاسل: | ICT Express |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.sciencedirect.com/science/article/pii/S2405959520300692 |
| الملخص: | To solve the bufferbloat problem, active queue management (AQM) has been recommended but existing AQM algorithms suffer from poor adaptability to dynamic traffics. We develop a novel adaptive AQM algorithm named TODU for a better Trade-Off between queuing Delay and link Utilization. TODU aims to maintain a stable queue length against dynamical network traffics by adapting the drop probability to balance the expected link utilization and queuing delay. We compare TODU with benchmark algorithms in Network Simulator-2 and the results demonstrate that TODU achieves a better trade-off between low queuing latency and high link utilization in a dynamical environment. |
|---|---|
| تدمد: | 2405-9595 |