Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
LTCP: improving the performance of TCP in highspeed networks
ACM SIGCOMM Computer Communication Review
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Hi-index | 0.00 |
Existing congestion control protocols have significant limitations in achieving high throughput and reasonable fairness while maintaining fast convergence speed in high bandwidth-delay product networks. In this paper, we propose the General Congestion Control Protocol (GCCP) to address this limitation. GCCP allows for aggressive behavior in large underutilized links to achieve high throughput, but leverages only one ECN bit for network utilization feedback. Once the link is sensed to be highly utilized, the protocol dedicates to fair and rapid bandwidth allocation by requiring congestion window increment is conservative and monotone decreasing with congestion window increasing. The ns2 simulations show that GCCP achieves a pretty good tradeoff between high throughput and reasonable fairness while exhibiting fast convergence speed.