A Simulation-Based Comparative Study of Controlled Delay (Codel) with Random early Detection (Red) for Network Performance Evaluation

Abstract

The rising need to use the internet for time/delay-sensitive applications with different Quality of Service (QOS) requirements has made network management and control even more challenging. The current congestion avoidance and control mechanisms for Transport Control Protocol (TCP) are insufficient to offer good service in all circumstances. A few decades ago, the TCP successfully regulated Internet congestion control. However, it is already widely acknowledged that TCP has reached its limits and that new congestion control protocols will be required in the near future. This has prompted a significant amount of research on novel congestion control designs that will meet the demands of the future Internet. With widespread public attention and study, the full buffer problem has not gone away, but rather worsened. As a result, there has been a surge in interest in using Active Queue Management (AQM) in Internet routers to minimize queue latency. The effectiveness of a recently developed AQM, Controlled Delay (CoDel) algorithm, designed to work in today’s network setups and can be deployed as a main part of the bufferbloat solution, is evaluated in this research study. CoDel's effectiveness is evaluated by running simulations in ns-3 and comparing its results to that of Random Early Detection (RED), another promising network queue management technique.