A Queueing Analysis of Data Networks

Thomas Bonald () and Alexandre Proutière ()
Additional contact information
Thomas Bonald: Orange Labs
Alexandre Proutière: Microsoft Research

Chapter 17 in Queueing Networks, 2011, pp 729-765 from Springer

Abstract: 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.

Keywords: Transmission Control Protocol; Capacity Region; Capacity Constraint; Proportional Fairness; Throughput Performance (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-6472-4_17

Ordering information: This item can be ordered from
http://www.springer.com/9781441964724

DOI: 10.1007/978-1-4419-6472-4_17

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().