How (Un)Fair are the ABR Binary Schemes, Actually? (CROSBI ID 492699)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Vojnovic, Milan ; Le Boudec, Jean-Yves
engleski
How (Un)Fair are the ABR Binary Schemes, Actually?
It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max-min fairness. In this paper we show how the rates are distributed for the network consisting of the binary switches, and end-systems employing an additive-increase/multiplicative decrease rate control. The modeling assumptions fairly resemble the ABR congestion avoidance, and apply to an arbitrary network topology. The results are obtained on the basis of a stochastic modeling, upon which we obtain certain analytical results, and conduct a numerical simulation. We validate the stochastic modeling through a discrete-event simulation. We believe that modeling presented in this paper enlight the performance issues of the binary ABR schemes.
ABR; ATM; congestion control; binary scheme; EFCI; fairness; max-min; proportional fairness; stochastic approximation; ODE; Lyapunov; Runge-Kutta
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
411-424-x.
1999.
objavljeno
Podaci o matičnoj publikaciji
Proceedings of SoftCOM '99
Split:
Podaci o skupu
SOFTCOM'99
predavanje
01.01.1999-01.01.1999
Split, Hrvatska