Abstract
A large number of research studies have been done on rate control algorithms. However, many of the proposed algorithms are complex and not scalable to high speeds and large number of connections. In most cases, it is difficult to quantitatively analyze their stability. Our aim in this paper is to provide insight into the design and analysis of a simple, scalable, and provably stable fair rate allocation algorithm. Using discrete-time linear analysis, we analyze quantitatively the performance of the rate control algorithm.
| Original language | British English |
|---|---|
| Pages (from-to) | 63-94 |
| Number of pages | 32 |
| Journal | Performance Evaluation |
| Volume | 43 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - Feb 2001 |