Study On Optimization-Based Networks Congestion Control Algorithm

Congestion control is very important in networks. Recently, the framework of Network Utility Maximization (NUM) has found many applications in network rate allocation algorithms, Internet congestion control protocols, network cross-layer optimization etc.Based on the framework of NUM, a class of end-to-end rate-based congestion control is considered and the local stability with round trip delay is analyzed; furthermore, a new rate-based congestion control algorithm for wireless networks is proposed, which considers price error in link, and convergence of this algorithm is studied and local stability in the presence of round trip delay is analyzed; besides, the effects of price error on the performance of the Newton-Like algorithm are also studied.Firstly, the application background of optimization-based congestion control is reviewed, and the purpose and significance of this work is introduced.Secondly, a class of end-to-end rate-based congestion control, in which the unavoidable random loss in packets is considered, is studied in wired/wireless network. Some sufficient conditions for local stability in the presence of round trip delay of these algorithms are obtained based on the general Nyquist criterion of stability. The stability conditions can be considered to be more general.Thirdly, a new rate-based congestion control algorithm for wireless networks is proposed based on the developed congestion control models for TCP-like schemes in the framework of NUM. The algorithm is proved to be global stability in the absence of round trip delay of each user and the convergence rate is also studied. A sufficient condition is obtained for the local stability of this algorithm in the presence of round trip delay. Simulation studied shows the results is right.At last, the effects of price error on the performance of the Newton-Like algorithm are considered, and the convergence and stability of this algorithm with price error is analyzed.