Yin, Qinghe and Low, Steven H. (2001) Convergence of REM flow control at a single link. IEEE Communications Letters, 5 (3). pp. 119-121. ISSN 1089-7798 http://resolver.caltech.edu/CaltechAUTHORS:YINieeecl01
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:YINieeecl01
Various TCP congestion control schemes can be interpreted as approximately carrying out a certain basic algorithm to maximize aggregate source utility, different schemes corresponding to different choices of utility functions. The basic algorithm consists of a link algorithm that updates a congestion measure based on its traffic load, and a source algorithm that adapts the source rate to congestion in its path. Though convergent, this algorithm can lead to large equilibrium backlogs. This problem can be eliminated by modifying the basic algorithm to include backlog in the update of the congestion measure. This article proves that the modified algorithm converges when the network can be modeled as a single bottleneck link. Moreover, in equilibrium, the source rates are matched to the link capacity while the buffer is cleared.
|Additional Information:||© Copyright 2001 IEEE. Reprinted with permission. Manuscript received August 31, 2000. The associate editor coordinating the review of this letter and approving it for publication was Dr. I.S. Venieris. This work was supported by the Australian Research Council under Grant S499705, Grant A49930405, and Grant S4005343.|
|Subject Keywords:||Active queue management, congestion control, convergence, REM, stability|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Archive Administrator|
|Deposited On:||21 Aug 2007|
|Last Modified:||26 Dec 2012 09:40|
Repository Staff Only: item control page