Improvement of Transmission Control Protocol for High Bandwidth Applications

Transmission control protocol (TCP) is the widely and dominantly used protocol in today’s internet. A very recent implementation of congestion control algorithm is BBR by Google. Bottleneck bandwidth and round-trip time (BBR) is a congestion control algorithm which is created with the aim of increasing throughput and reducing delay. The congestion control protocols mentioned previously try to determine congestion limits by filling router queues. BBR drains the router queues at the bottleneck by sending exactly at the bottleneck link rate. This is done by the BBR through pacing rate which infers the delivery rate of the receiver and uses this as the estimated bottleneck bandwidth. But when the data rate is high, in the startup phase itself pipe becomes full and leads to some degradation in the Access Point of wireless environments by inducing losses specific to this environment. So the current pacing rate is not suitable for producing higher throughputs. Therefore, in the proposed system named R-BBR, this startup gain should be lower than the current startup gain which eventually would reduce pacing rate to reduce queue pressure in the sink node during the startup phase. The startup phase of BBR is modified to solve the problem of pipe full under high data rate. R-BBR has been evaluated over a wide range of wired as well as wireless networks by varying different factors like startup gain, congestion window, and pacing rate. It is inferred that R-BBR performs better than BBR with significant performance improvement.