ABCSS: A novel approach for increasing the TCP congestion window in a network

Abstract

Congestion control is a useful task to be taken into account in order to maintain a good traffic in a network. In the case of a TCP/IP (Transmission Control Protocol/Internet Protocol) network, congestion creates queues in routers and even packet rejection. It is the reason why research have been conducted to improve congestion control mechanisms. Nowadays, several TCP congestion algorithms have been implemented. However, with the technology evolution and the need in terms of traffic capacity, various mechanisms implemented by these algorithms have shown their limitations and still need to be improved. The aim of this paper is to develop a novel TCP congestion control approach based on two famous algorithms: Appropriate Byte Counting (ABC) and Slow Start (SS). The results obtained show that ABC increases the congestion window appropriately compared to Slow Start. However, the congestion window remains invariant during the first round trips, which causes the TCP burst phenomenon. The TCP splitting can cause buffer overflows and long queues. For theses shortcomings, we propose ABCSS as a novel approach that appropriately increase the TCP congestion window and minimize the TCP splitting problem. The simulations of ABCSS algorithm provide interesting results compared to some known algorithms.