Routing-independent fairness in capacitated networks

Gábor Rétvári, József J. Bíró, Tibor 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 publication2007 IEEE International Conference on Communications, ICC'07
Pages6344-6349
Number of pages6
DOIs
Publication statusPublished - Dec 1 2007
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: Jun 24 2007Jun 28 2007

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

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

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Routing-independent fairness in capacitated networks'. Together they form a unique fingerprint.

  • Cite this

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