Abstract
We study the adaptation capabilities and robustness of the high-speed TCP CUBIC algorithm. For this purpose we consider a network environment with variable and high random packet loss and a large Bandwidth-Delay product, shared by multiple heterogeneous TCP connections. The analysis is based on and supported by packet-level simulations. The results show that the aggressive nature of CUBIC's nonlinear congestion window control principle causes a degradation of the time-average throughput at the moderate level of random packet loss even under increasing Round-Trip-Time of the flow. However, this algorithmic scalability and loss-free-time-dependent window growth allows recovering transmission rate faster in the high packet loss region due to the statistically lower number of dropped packets, compared to the moderate loss level.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
