How ( Un ) Fair are the ABR Binary Schemes , Actually ?

@inproceedings{Ilan1999HowU,
  title={How ( Un ) Fair are the ABR Binary Schemes , Actually ?},
  author={Micha Ilan and OJNOVI{\'C}},
  year={1999}
}
– 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 resembles the ABR congestion avoidance, and applies to an arbitrary network topology. The… CONTINUE READING

Similar Papers

Loading similar papers…