Throughput performance in networks with linear capacity contraints

T. Bonald

doi:10.1109/CISS.2006.286547

Throughput performance in networks with linear capacity contraints

T. Bonald

Orange Labs

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original language	English
Title of host publication	2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	644-649
Number of pages	6
ISBN (Print)	1424403502, 9781424403509
DOIs	https://doi.org/10.1109/CISS.2006.286547
Publication status	Published - 1 Jan 2006
Externally published	Yes
Event	2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States Duration: 22 Mar 2006 → 24 Mar 2006

Publication series

Name	2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Conference

Conference	2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
Country/Territory	United States
City	Princeton, NJ
Period	22/03/06 → 24/03/06

Keywords

Balanced fairness
Flow throughput

Access to Document

10.1109/CISS.2006.286547

Cite this

Bonald, T. (2006). Throughput performance in networks with linear capacity contraints. In 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings (pp. 644-649). Article 4067888 (2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CISS.2006.286547

@inproceedings{261e317a02e94fcab5a374eb682871b2,

title = "Throughput performance in networks with linear capacity contraints",

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.",

keywords = "Balanced fairness, Flow throughput",

author = "T. Bonald",

year = "2006",

month = jan,

day = "1",

doi = "10.1109/CISS.2006.286547",

language = "English",

isbn = "1424403502",

series = "2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "644--649",

booktitle = "2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings",

note = "2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 ; Conference date: 22-03-2006 Through 24-03-2006",

}

Bonald, T 2006, Throughput performance in networks with linear capacity contraints. in 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings., 4067888, 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 644-649, 2006 40th Annual Conference on Information Sciences and Systems, CISS 2006, Princeton, NJ, United States, 22/03/06. https://doi.org/10.1109/CISS.2006.286547

Throughput performance in networks with linear capacity contraints. / Bonald, T.
2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2006. p. 644-649 4067888 (2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Throughput performance in networks with linear capacity contraints

AU - Bonald, T.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

KW - Balanced fairness

KW - Flow throughput

U2 - 10.1109/CISS.2006.286547

DO - 10.1109/CISS.2006.286547

M3 - Conference contribution

AN - SCOPUS:44049103205

SN - 1424403502

SN - 9781424403509

T3 - 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

SP - 644

EP - 649

BT - 2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2006 40th Annual Conference on Information Sciences and Systems, CISS 2006

Y2 - 22 March 2006 through 24 March 2006

ER -

Throughput performance in networks with linear capacity contraints

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this