Performance evaluation of TCP-BIAD in high-speed, long-distance networks

In this paper, the performance of Binary Increase Adaptive Decrease (TCP-BIAD) congestion control algorithm in high-speed long-distance networks is evaluated. As its name implies, this TCP variant is a combination of an enhanced binary increase algorithm during the congestion avoidance phase with the adaptive decrease mechanism of TCP Westwood after a packet loss episode. We also propose a mathematical analysis of the TCP-BIAD paradigm to study the steady-state throughput provided by TCP-BIAD and investigate the intra-protocol friendliness between TCP-BIAD and Additive Increase/Multiplicative Decrease algorithms. Our analysis shows that TCP-BIAD algorithm is exponentially stable, while maintaining an adequately fair and friendly behavior with respect to co-existing TCP-Reno flows. Finally, our results are validated with respect to other TCP variants such as BIC-TCP, CUBIC, HighSpeed TCP, HTCP, Hybla and TCP-Reno by means of computer simulations in networks with large bandwidth-delay products and low sensitivity to RTT values.