000000157 001__ 157
000000157 005__ 20190316233047.0
000000157 037__ $$aCONF
000000157 245__ $$aA Note on the Fairness of Additive Increase and Multiplicative Decrease
000000157 269__ $$a1999
000000157 260__ $$c1999
000000157 336__ $$aConference Papers
000000157 520__ $$aSome recent papers [KMT97, MR98] have shown that congestion control based on additive increase and multiplicative decrease tends to share bandwidth according to proportional fairness. Proportional fairness is a form of fairness which distributes bandwidth with a bias in favour of flows using a smaller number of hops, this is in contrast with max-min fairness, which gives absolute priority to small flows. We revisit those results by using the modelling framework based on the ordinary differential equation method in [LJU77, KC78]. We find that for the case of small increments and constant round trip times, and in the regime of rare negative feedback, the proportional fairness result can only very approximately reflect the real rate allocation when we assume that the feedback received by sources is independent of their sending rates. In the case where sources receive feedback proportionally to their sending rates, and still for sources with identical round trip times, this is no longer true and the fairness provided is different. We show, by simulation on some examples, that even for larger increments, the average rate convergence is in agreement with our results. Finally, we establish that in the event of rate proportional feedback, our results maintain consistency with the well-known derivations relating TCP throughput as a function of loss ratio. However, this does not hold for the rate independent case, which we consider further validation ofthe assumption of rate dependent feedback.
000000157 6531_ $$aadditive increase
000000157 6531_ $$amultiplicative decrease
000000157 6531_ $$acongestion control
000000157 6531_ $$aTransmission Control Protocol (TCP)
000000157 6531_ $$afairness
000000157 6531_ $$aproportionalfairness
000000157 6531_ $$aLyapunov
000000157 6531_ $$aparking lot
000000157 6531_ $$athe ordinary differential equation (ODE) method.
000000157 700__ $$aHurley, Paul
000000157 700__ $$0241098$$aLe Boudec, Jean-Yves$$g105633
000000157 700__ $$0240373$$aThiran, Patrick$$g103925
000000157 7112_ $$aITC-16$$cEdinburgh
000000157 773__ $$tITC-16
000000157 8564_ $$s237482$$uhttps://infoscience.epfl.ch/record/157/files/HurleyLT99b.pdf$$zn/a
000000157 909C0 $$0252614$$pLCA$$xUS00024
000000157 909C0 $$0252453$$pLCA2$$xU10427
000000157 909C0 $$0252454$$pLCA3$$xU10431
000000157 909CO $$ooai:infoscience.tind.io:157$$pconf$$pIC$$qGLOBAL_SET
000000157 937__ $$aLCA-CONF-1999-006
000000157 970__ $$a289/LCA
000000157 973__ $$aEPFL$$sPUBLISHED
000000157 980__ $$aCONF