Abstract
The traditional congestion control algorithms exhibit low convergence rate to equilibrium when the network capacity is very large. In this paper, we present a new group of algorithms called Quick Kelly Control (QKC) to accelerate the convergence rate. QKC is scalable to networks operating at very high speeds. The link utilization ratio function is used as feedback signal and a group of novel nonlinear update laws is constructed. We prove the stability of a primal-dual form of QKC (PDQKC) without considering delay. We also compare this algorithm with two classic algorithms and give simulation results. It is shown that PDQKC has powerful bandwidth scalability and offers fast convergence rate without sacrificing proportional fairness.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
