Abstract

Abstract 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.