Routing-independent fairness in capacitated networks

Gábor Rétvári, József J. Bíró, T. Cinkler

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is an extension of network fairness, and in particular, max-min fairness from the traditional "fixed-path" model to a more versatile, routing-independent model. We show that the set of throughput configurations realizable in a capacitated network makes up a polyhedron, which gives rise to a max-min fair allocation completely analogous to the conventional case.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages6344-6349
Number of pages6
DOIs
Publication statusPublished - 2007
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: Jun 24 2007Jun 28 2007

Other

Other2007 IEEE International Conference on Communications, ICC'07
CountryUnited Kingdom
CityGlasgow, Scotland
Period6/24/076/28/07

Fingerprint

Throughput

ASJC Scopus subject areas

  • Media Technology

Cite this

Rétvári, G., Bíró, J. J., & Cinkler, T. (2007). Routing-independent fairness in capacitated networks. In IEEE International Conference on Communications (pp. 6344-6349). [4289721] https://doi.org/10.1109/ICC.2007.1050

Routing-independent fairness in capacitated networks. / Rétvári, Gábor; Bíró, József J.; Cinkler, T.

IEEE International Conference on Communications. 2007. p. 6344-6349 4289721.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Rétvári, G, Bíró, JJ & Cinkler, T 2007, Routing-independent fairness in capacitated networks. in IEEE International Conference on Communications., 4289721, pp. 6344-6349, 2007 IEEE International Conference on Communications, ICC'07, Glasgow, Scotland, United Kingdom, 6/24/07. https://doi.org/10.1109/ICC.2007.1050
Rétvári G, Bíró JJ, Cinkler T. Routing-independent fairness in capacitated networks. In IEEE International Conference on Communications. 2007. p. 6344-6349. 4289721 https://doi.org/10.1109/ICC.2007.1050
Rétvári, Gábor ; Bíró, József J. ; Cinkler, T. / Routing-independent fairness in capacitated networks. IEEE International Conference on Communications. 2007. pp. 6344-6349
@inproceedings{fc78e95c9f5644ce909fe4be0a7021cb,
title = "Routing-independent fairness in capacitated networks",
abstract = "The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is an extension of network fairness, and in particular, max-min fairness from the traditional {"}fixed-path{"} model to a more versatile, routing-independent model. We show that the set of throughput configurations realizable in a capacitated network makes up a polyhedron, which gives rise to a max-min fair allocation completely analogous to the conventional case.",
author = "G{\'a}bor R{\'e}tv{\'a}ri and B{\'i}r{\'o}, {J{\'o}zsef J.} and T. Cinkler",
year = "2007",
doi = "10.1109/ICC.2007.1050",
language = "English",
isbn = "1424403537",
pages = "6344--6349",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Routing-independent fairness in capacitated networks

AU - Rétvári, Gábor

AU - Bíró, József J.

AU - Cinkler, T.

PY - 2007

Y1 - 2007

N2 - The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is an extension of network fairness, and in particular, max-min fairness from the traditional "fixed-path" model to a more versatile, routing-independent model. We show that the set of throughput configurations realizable in a capacitated network makes up a polyhedron, which gives rise to a max-min fair allocation completely analogous to the conventional case.

AB - The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is an extension of network fairness, and in particular, max-min fairness from the traditional "fixed-path" model to a more versatile, routing-independent model. We show that the set of throughput configurations realizable in a capacitated network makes up a polyhedron, which gives rise to a max-min fair allocation completely analogous to the conventional case.

UR - http://www.scopus.com/inward/record.url?scp=38549144759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38549144759&partnerID=8YFLogxK

U2 - 10.1109/ICC.2007.1050

DO - 10.1109/ICC.2007.1050

M3 - Conference contribution

AN - SCOPUS:38549144759

SN - 1424403537

SN - 9781424403530

SP - 6344

EP - 6349

BT - IEEE International Conference on Communications

ER -