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.
Type de document :
Communication dans un congrès
CISS, 2006, Princeton, United States. Proceedings of CISS
https://hal.inria.fr/hal-01277609
Contributeur : Thomas Bonald
<>
Soumis le : lundi 22 février 2016 - 18:44:26
Dernière modification le : vendredi 25 mai 2018 - 12:02:04
Document(s) archivé(s) le : lundi 23 mai 2016 - 14:51:46
Thomas Bonald. Throughput Performance in Networks with Linear Capacity Contraints. CISS, 2006, Princeton, United States. Proceedings of CISS. 〈hal-01277609〉
