Palermo Congestion Control: buffer bloat prevention based on capacity share estimation

This work proposes a congestion control scheme aiming to improve both buffer bloat prevention and fair sharing of the available capacity. The algorithm is based on the estimation of the share of the available capacity of the connection. The proposed algorithm obtains significant latency and fair sharing improvements when network conditions allow, and reverts to regular TCP behavior when the opportunity for improvement is not available. The algorithm has been implemented as sender side congestion control to improve outgoing traffic, and as receiver side congestion control to improve incoming traffic. In both cases requiring no modifications to the peer TCP stack.The algorithm has been implemented for Linux kernel. In the sender side case, it was implemented as a dynamic loadable module. In the receiver side case, as a modification of the TCP stack replacing the DRS (dynamic right sizing algorithm). Results are very promising and performance figures are similar to other state of the art algorithms like BBR.