%0 Conference Paper %1 Schwarzkopf2016 %A Schwarzkopf, Fabian %A Veith, Sebastian %A Menth, Michael %B 28th International Teletraffic Congress (ITC 28) %C Würzburg, Germany %D 2016 %K itc itc28 %T Performance Analysis of CoDel and PIE for Saturated TCP Sources %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc28/Schwarzkopf2016.pdf?inline=true %X In the recent years, the bufferbloat phenomenon was observed which is mainly due to oversized unmanaged buffers in the Internet. This triggered a new discussion of active queue management (AQM) algorithms in the IETF. "Controlled Delay" (CoDel) and "Proportional Integral controller Enhanced" (PIE) are considered as an alternative to "Random Early Detection" (RED). Their intention is both to take advantage of large buffers for occasional bursts and to limit queueing delays most of the time. Moreover, they are able to cope with varying bandwidth. In this paper, we study the performance of CoDel, PIE, and CoDel-ACT, which is an effective modification of CoDel that leads to better performance than CoDel in our studies. We experiment with saturated TCP sources and a fixed-bandwidth bottleneck link and focus on the delay-limiting phase of the algorithms. We investigate the impact of configuration parameters and traffic load on link utilization and queueing delay. We study the timely evolution of queuing delays and drop patterns, and point out significant differences among the algorithms. In particular, we show that CoDel's drop behavior changes over time and may lead to underutilization.

@inproceedings{Schwarzkopf2016, abstract = {In the recent years, the bufferbloat phenomenon was observed which is mainly due to oversized unmanaged buffers in the Internet. This triggered a new discussion of active queue management (AQM) algorithms in the IETF. "Controlled Delay" (CoDel) and "Proportional Integral controller Enhanced" (PIE) are considered as an alternative to "Random Early Detection" (RED). Their intention is both to take advantage of large buffers for occasional bursts and to limit queueing delays most of the time. Moreover, they are able to cope with varying bandwidth. In this paper, we study the performance of CoDel, PIE, and CoDel-ACT, which is an effective modification of CoDel that leads to better performance than CoDel in our studies. We experiment with saturated TCP sources and a fixed-bandwidth bottleneck link and focus on the delay-limiting phase of the algorithms. We investigate the impact of configuration parameters and traffic load on link utilization and queueing delay. We study the timely evolution of queuing delays and drop patterns, and point out significant differences among the algorithms. In particular, we show that CoDel's drop behavior changes over time and may lead to underutilization.}, added-at = {2016-08-31T16:30:53.000+0200}, address = {Würzburg, Germany}, author = {Schwarzkopf, Fabian and Veith, Sebastian and Menth, Michael}, biburl = {https://www.bibsonomy.org/bibtex/24521ce72bb8a17c775679fe1bc3d2bd6/itc}, booktitle = {28th International Teletraffic Congress (ITC 28)}, days = {12}, interhash = {38ab4a506f98d8d07faee0d0a1d53580}, intrahash = {4521ce72bb8a17c775679fe1bc3d2bd6}, keywords = {itc itc28}, month = {Sept}, timestamp = {2020-05-26T16:53:35.000+0200}, title = {Performance Analysis of CoDel and PIE for Saturated TCP Sources}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc28/Schwarzkopf2016.pdf?inline=true}, year = 2016 }