Abstract : We consider a network whose resources are shared by a dynamic number of data flows according to balanced fairness. We give explicit bounds on the mean throughput that results from this stochastic resource sharing when the capacity constraints are linear. We illustrate the results on a few examples of wireline and wireless networks.
https://hal.inria.fr/hal-01277609
Contributor : Thomas Bonald
<>
Submitted on : Monday, February 22, 2016 - 6:44:26 PM
Last modification on : Friday, May 25, 2018 - 12:02:04 PM
Long-term archiving on : Monday, May 23, 2016 - 2:51:46 PM
