End-to-end rate-based congestion control with random loss:convergence and stability  

作　　者：Sun Wei Tian Naishuo Li Shiyong Guan Xinping 

机构地区：[1]Coll. of Information Science and Engineering, Yanshan Univ., Qinhuangdao 066004, P. R. China [2]Coll. of Science, Yanshan Univ., Qinhuangdao 066004, P. R. China [3]School of Electronics and Information Engineering, Beijing Jiaotong Univ., Beijing 100044, P. R. China [4]Inst. of Electrical Engineering, Yanshan Univ., Qinhuangdao 066004, P. R. China

出　　处：《Journal of Systems Engineering and Electronics》2008年第6期1208-1214,共7页系统工程与电子技术（英文版）

基　　金：supported in part by the National Natural Science Foundation of China (10671170,60404022);the National Outstanding Youth Foundation of China (60525303);and the Natural Science Foundation of Hebei Province (07M005,F2008000864)

摘　　要：The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.The convergence and stability analysis for two end-to-end rate-based congestion control algorithms with unavoidable random loss in packets are presented, which can be caused by, for example, errors on wireless links. The convergence rates of these two algorithms are analyzed by linearizing them around their equilibrium points, since they are globally stable and can converge to their unique equilibrium points. Some sufficient conditions for local stability in the presence of round-trip delay are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general. If random loss in the first congestion control algorithm is not considered, they reduce to the local stability conditions which have been obtained in some literatures. Furthermore, sufficient conditions for local stability of a new congestion control algorithm have also been obtained if random loss is not considered in the second congestion control algorithm.

关 键 词：congestion control random loss DELAY CONVERGENCE STABILITY Nyquist criterion. 

分 类 号：O23[理学—运筹学与控制论]