Linear, Fractional, and Expolinear: Fair and Efficient Congestion Control Algorithms for TCP in Lossy and Delay-Sensitive Networks

As the number of devices connected to the Internet increases, the response of applications to competition for network resources and, consequently, to congestion has become a critical issue that affects service quality and user experience. Next-generation networks, such as beyond 5G, 6G, and low Earth orbit (LEO) satellite networks, face additional challenges due to their high sensitivity to delays and packet losses. This paper proposes three TCP congestion control algorithms (CCA) models, named Expolinear, Fractional, and Linear, which leverage packet loss information to dynamically adjust the congestion window (CWND), improving efficiency and adaptability to varying network conditions. We have implemented the algorithms as Linux kernel modules and compared them to traditional algorithms. The proposed models demonstrated up to ten times greater transmission rate efficiency in high packet loss scenarios while maintaining fairness in bandwidth usage among competing flows.