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 de l'École normale supérieure, 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 metadatas

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

File

ciss06.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01277609, version 1

Collections

Citation

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

Share

Metrics

Record views

258

Files downloads

129