Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new congestion control scheme: slow start and search (Tri-S)
ACM SIGCOMM Computer Communication Review
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Improving TCP Congestion Control over Internets with Heterogeneous Transmission Media
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Congestion Control in Computer Networks
Congestion Control in Computer Networks
Issues and trends in router design
IEEE Communications Magazine
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we present a novel congestion control algorithm for the Transmission Control Protocol (TCP) for the future Internet. Our assumption of future Internet is that, with the increasing quality of service (QoS) requirements, per-flow packet scheduling (per-flow here refers to per TCP or UDP connection) will replace the current first-come-first-serve algorithm used in routers. Based on the assumption, we design a new congestion control algorithm. In our TCP-CC algorithm, each connection adjusts the size of the congestion window according to the size of its packet queue at the bottleneck router. Thus, the queue size for each connection at the bottleneck router is within a controlled range. We show that congestion loss is effectively reduced compared to the current TCP congestion algorithm.