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
Random drop congestion control
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end rate-based congestion control: convergence properties and scalability analysis
IEEE/ACM Transactions on Networking (TON)
Scalable Performance Signalling and Congestion Avoidance
Scalable Performance Signalling and Congestion Avoidance
Delayed stability and performance of distributed congestion control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A new congestion control mechanism of TCP with inline network measurement
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Distributed bandwidth allocation based on alternating evolution algorithm
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Since traditional TCP congestion control is ill-suited for high speed networks, designing a high speed replacement for TCP has become a challenge. From the simulations of some existing high speed protocols, we observe that these high speed protocols make the round-trip time bias problem and the multiple-bottleneck bias problem more serious than for standard TCP. To address these problems, we apply the population ecology theory to design a novel congestion control algorithm. By analogy, we treat the network flows as the species in nature, the sending rates of the flows as the population number, and the bottleneck bandwidth as the food resources. Then we extend the construction method of population ecology models to design a control model, and implement the corresponding end-to-end protocol with virtual load factor feedback, which is called Explicit Virtual Load Feedback TCP (EVLF-TCP). The virtual load factor is computed based on the information of the bandwidth, the aggregate incoming traffic and the queue length in routers, and then senders adjust the sending rate based on the virtual load factor. Theoretical analysis and simulation results validate that EVLF-TCP achieves high utilization, fair bandwidth allocation independent of round-trip time, and near-zero packet drops. These characteristics are desirable for high speed networks.