Global Stability of Internet Congestion Control with Delayed Feedback and One-Bit Marking

摘要

In this paper, we first present a brief survey of the state-of-the art in Internet congestion control and then focus on the problem of designing globally stable, scalable congestion control algorithms for the Internet in the presence of feedback delay. Using Razumikhin's theorem, a sufficient condition for global stability has been obtained in (Ying et al., 2004) in terms of the increase/decrease parameters of the congestion control algorithm and the parameters of the resource price functions. In this paper, the result is extended to networks where only one bit is available in the packet header to convey congestion information.