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
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
A hop by hop rate-based congestion control scheme
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Model-based approach to tcp-friendly congestion control
Model-based approach to tcp-friendly congestion control
| Hi-index | 0.01 |
With the rapid emergence of new services and quick changes of traffic in the Internet, the widely used end-to-end congestion control mechanism becomes insufficient. This paper presents a novel RED-based hop-by-hop congestion control mechanism which is based on the coordination of the routers and the hosts. No per-flow state information is maintained in the routers. The application itself need not take care of the rate adaptation. The mechanism provides a uniform solution accommodating both responsive and unresponsive traffic with trivial overhead. It reduces the packet loss to zero and leads to higher network resource utilization. Response time to congestion is greatly reduced. The mechanism has been implemented in the Linux kernel. Some preliminary experiments show its advantages.