A large number of research studies have been done on rate control algorithm
s. However, many of the proposed algorithms are complex and not scalable to
high speeds and large number of connections. In most cases, it is difficul
t to quantitatively analyze their stability. Our aim in this paper is to pr
ovide insight into the design and analysis of a simple, scalable, and proba
bly stable fair rate allocation algorithm. Using discrete-time linear analy
sis, we analyze quantitatively the performance of the rate control algorith
m. (C) 2001 Elsevier Science B.V. All rights reserved.