Tuesday, September 9, 2008

Reading on"analysis of the increase and decrease algorithms for congestion avoidance in computer networks"

This paper presents the additive increase and multiplicative decrease algorithms is the best way to do congestion avoidance based on some metrics of fairness, distributedness and so on. The authors confirmed their conclusion through analysis on the simple model which only contains two users. In the end of the paper, the authors gives us a lot of future work. 
I do think it is a very good paper. It uses simple math knowledge to infer useful conclusion. 

No comments: