Skip to Main content Skip to Navigation
Conference papers

Throughput Performance in Networks with Linear Capacity Contraints

Thomas Bonald 1, 2
1 TREC - Theory of networks and communications
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt
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.
Complete list of metadata
Contributor : Thomas Bonald Connect in order to contact the contributor
Submitted on : Monday, February 22, 2016 - 6:44:26 PM
Last modification on : Tuesday, January 11, 2022 - 11:16:21 AM
Long-term archiving on: : Monday, May 23, 2016 - 2:51:46 PM


Files produced by the author(s)


  • HAL Id : hal-01277609, version 1



Thomas Bonald. Throughput Performance in Networks with Linear Capacity Contraints. CISS, 2006, Princeton, United States. ⟨hal-01277609⟩



Les métriques sont temporairement indisponibles