摘要
The stability of the Newton-like algorithm in optimization flow control is considered in this paper. This algorithm is proved to be globally stable under a general network topology by means of Lyapunov stability theory,without considering the round trip time of each source. While the stability of this algorithm with considering the round trip time is analyzed as well. The analysis shows that the algorithm with only one bottleneck link accessed by several sources is also globally stable,and all trajectories described by this algorithm ultimately converge to the equilibrium point.
The stability of the Newton-like algorithm in optimization flow control is considered in this paper. This algorithm is proved to be globally stable under a general network topology by means of Lyapunov stability theory, without considering the round trip time of each source. While the stability of this algorithm with considering the round trip time is analyzed as well. The analysis shows that the algorithm with only one bottleneck link accessed by several sources is also globally stable, and all trajectories described by this algorithm ultimately converge to the equilibrium point.
基金
the National Outstanding Youth Foundation of China (Grant No.60525303)
the NNSF of China( Grant No.60404022 and 60604004)
the NSF of Hebei Province (Grant No.102160)
the Special Projects in Mathematics Funded by Natural Science Foundation of Hebei Prov-ince(Grant No.07M005)
the NS of Education Office in Hebei Province (Grant No.2004123).
