Feedback-based adjustment of load is a common mechanism for resource allocation in computer networks. This paper disputes the popular beliefs that the additive-increase multiplicative-decrease adjustment policy is optimal or even necessary for convergence to fair resource sharing. We demonstrate that, in the classic synchronous model, additive increase does not guarantee the quickest convergence of fairness. Moreover, not only fairness but also efficiency converges very slowly under additive increase. For an asynchronous model, we show that the additive-increase multiplicative-decrease algorithm fails to converge to optimal fairness. We observe that the TCP congestion control algorithm suffers from the problems detected by our analysis and is unfair.
[1]
Raj Jain,et al.
Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks
,
1989,
Comput. Networks.
[2]
V. Jacobson.
Congestion avoidance and control
,
1988,
CCRV.
[3]
K. K. Ramakrishnan,et al.
A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer
,
1995,
CCRV.
[4]
Bruce S. Davie,et al.
Computer Networks: A Systems Approach
,
1996
.
[5]
Raj Jain,et al.
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
,
1998,
ArXiv.