From: Yuhan Cai (yuhancai@cs.washington.edu)
Date: Tue Oct 19 2004 - 21:12:18 PDT
Title: Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks
Author: Dah-Ming Chiu and Raj Jain
Reviewed by: Yuhan Cai
Main results of the paper:
， A wide range of congestion avoidance algorithms are characterized and compared with each other using several performance metrics.
， The paper identifies the possible causes, key notations, prominent phenomena, important criteria and feasible solutions of congestion avoidance.
Strengths of the paper:
， It formulates the congestion problems with prototypical system control problems and presents the key algorithms to solve them.
， Performance comparisons are done with respect to a great variety of metrics.
， The schemes allow networks to operate at regions of low delay, high throughput, maximized efficiency and fairness.
Key limitations:
， The issues addressed in this paper are on the theoretical level. It mainly proves when and why a control converges, but does not propose any innovative new controls.
Relevance of the paper:
， This is an influential paper and the decisions of many other algorithms are based on it. Additionally, it is general enough to be applied to other areas.
Future work:
， It might be of further interest as whether it's possible to optimize the speed of convergence of all control schemes without affecting other criteria.
This archive was generated by hypermail 2.1.6 : Tue Oct 19 2004 - 21:12:24 PDT