Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 628583, 13 pages
Research Article

Cascade Probability Control to Mitigate Bufferbloat under Multiple Real-World TCP Stacks

1Department of Information and Communication System, Inje University, Gimhae, Gyeongnam 621-749, Republic of Korea
2Department of Information and Communications Engineering, Inje University, Gimhae, Gyeongnam 621-749, Republic of Korea

Received 22 June 2015; Accepted 13 August 2015

Academic Editor: Rongwei Guo

Copyright © 2015 Hoang-Linh To et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Persistently full buffer problem, commonly known as bufferbloat, causes unnecessary additional latency and throughput degradation whenever congestion happens in Internet. Several proposed queue management schemes, with the debloat mission, are almost based on the modification of one-loop feedback control where the instability and bad transient behavior are still big challenges. In this paper, we present a cascade probability control scheme using margin optimal method to address such challenges under different kinds of real-world TCP stacks. Simulation results guarantee the measured round trip time tracking to a low value of delay (e.g., ≈180 ms under TCP Reno, and ≈130 ms under TCP Cubic) and ≈50% delay reduction in comparison to current deployed queue management schemes in network devices.