An Improved Internet Congestion Control Algorithm

An improved delay dual algorithm of Internet congestion control is presented, where the price function p(t) is introduced as a proportional term to determine the varying rate of its own. This modified algorithm can achieve desired performance mainly in that its stable range can be turned out to be greater than that of traditional delay dual algorithms. In addition, this new algorithm is more flexible in that the stable range can be regulated by choosing different system parameters. Finally its advantage is verified by both theoretical analyses and numerical simulations.

[1]  Xiaofeng Liao,et al.  Stability and Hopf bifurcation analysis in a novel congestion control model with communication delay , 2008 .

[2]  Ji-Huan He.  Periodic solutions and bifurcations of delay-differential equations , 2005 .

[3]  K. Gopalsamy,et al.  Delay induced periodicity in a neural netlet of excitation and inhibition , 1996 .

[4]  Donald F. Towsley,et al.  Analysis and design of controllers for AQM routers supporting TCP flows , 2002, IEEE Trans. Autom. Control..

[5]  Gaurav Raina,et al.  Local bifurcation analysis of some dual congestion control algorithms , 2005, IEEE Transactions on Automatic Control.

[6]  Guanrong Chen,et al.  Hopf bifurcation in an Internet congestion control model , 2004 .

[7]  Donald F. Towsley,et al.  A control theoretic analysis of RED , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Jie Zhu,et al.  Hopf bifurcation analysis in a fluid flow model of Internet congestion control algorithm , 2009 .

[9]  Frank Kelly,et al.  Fairness and Stability of End-to-End Congestion Control , 2003, Eur. J. Control.

[10]  Christopher V. Hollot,et al.  Nonlinear stability analysis for a class of TCP/AQM networks , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).