On the Convergence of Rate Based Flow ControlYehuda
Several issues in the design and analysis of rate based ow control algorithms are addressed in this paper. We suggest a new approach for rate based ow control algorithms which may be considered more \optimistic" than traditional approaches. Three variations of the approach are presented and their rate of convergence to an optimal max-min fairness solution is analyzed. Finally, we suggest and analyze approximate rate based ow control algorithms. We show that under certain conditions the approximate algorithms may converge faster. However, in rare conngurations we show that the resulting rates may be substantially diierent than the rates of the max-min vector (this diierence is not necessarily bad).