@inbook{c03938b7ab1f45ab9c9611ef072d3614,
title = "A queueing analysis of data networks",
abstract = "In packet-switched networks, resources are typically shared by a dynamic set of data flows. This dynamic resource sharing can be represented by a queueing network with state-dependent service rates. For a specific resource allocation we refer to as balanced fairness the corresponding queueing network is a Whittle network and has an explicit stationary distribution. We give some key properties satisfied by balanced fairness and compare the resulting throughput performance to those obtained under the max-min fair and proportional fair allocations.",
author = "Thomas Bonald and Alexandre Prouti{\`e}re",
note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media, LLC 2011.",
year = "2011",
month = jan,
day = "1",
doi = "10.1007/978-1-4419-6472-4\_17",
language = "English",
series = "International Series in Operations Research and Management Science",
publisher = "Springer New York LLC",
pages = "729--765",
booktitle = "International Series in Operations Research and Management Science",
}