TCP-real: improving real-time capabilities of TCP over heterogeneous networks
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
CAVT: a congestion avoidance visualization tool
ACM SIGCOMM Computer Communication Review
LIMERIC: a linear message rate control algorithm for vehicular DSRC systems
VANET '11 Proceedings of the Eighth ACM international workshop on Vehicular inter-networking
| Hi-index | 0.00 |
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.