Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Tuning of PID controllers based on gain and phase margin specifications
Automatica (Journal of IFAC)
Linear System Theory and Design
Linear System Theory and Design
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Internet research needs better models
ACM SIGCOMM Computer Communication Review
Why flow-completion time is the right metric for congestion control
ACM SIGCOMM Computer Communication Review
Design of Adaptive PI Rate Controller for Best-Effort Traffic in the Internet Based on Phase Margin
IEEE Transactions on Parallel and Distributed Systems
Jetmax: Scalable max-min congestion control for high-speed heterogeneous networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rate control protocol (rcp): congestion control to make flows complete quickly
Rate control protocol (rcp): congestion control to make flows complete quickly
Stability and fairness of explicit congestion control with small buffers
ACM SIGCOMM Computer Communication Review
Processor sharing flows in the internet
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Advances in internet congestion control
IEEE Communications Surveys & Tutorials
Brief paper: Self-clocking principle for congestion control in the Internet
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
Recently, eXplicit Control Protocol (XCP), Rate Control Protocol (RCP), and Adaptive Proportional-Integral Rate Control Protocol (API-RCP) have been proposed for congestion control, with the main objective of achieving fair and maximum bandwidth utilization. However, studies reveal that both RCP and XCP may suffer continuous oscillations due to misestimating the bottleneck link capacity, and API-RCP may experience oscillations because of its PI adaptivity scheme which involves switching nonlinearity. To avoid these problems, in this paper a way of designing congestion control based on the instantaneous queue sizes in the routers is proposed. The new scheme attains high link utilization and smooth dynamics by clamping the bottleneck queue at a desired size. And it maintains good fairness by allocating the bottleneck bandwidth equally to the competing flows. Simulations are performed to verify the effectiveness of the theoretical design.