Result: A polynomial algorithm for solving a general max-min fairness problem
Title:
A polynomial algorithm for solving a general max-min fairness problem
Authors:
Source:
Special Issue on the 2nd Polish-German Teletraffic Symposium, Gdanśk 2002European transactions on telecommunications. 16(3):233-240
Publisher Information:
Chichester: Wiley, 2005.
Publication Year:
2005
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Subject Terms:
Electronics, Electronique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Télétrafic, Teletraffic, Algorithme, Algorithm, Algoritmo, Allocation ressource, Resource allocation, Asignación recurso, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Equité, Equity, Equidad, Gestion trafic, Traffic management, Gestión tráfico, Méthode itérative, Iterative method, Método iterativo, Méthode polynomiale, Polynomial method, Método polinomial, Routage, Routing, Enrutamiento
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute of Telecommunications, Warsaw University of Technology, Nowowiejsku 15/19, 00-665 Warszawa, Poland
ISSN:
1124-318X
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.16944772
Database:
PASCAL Archive
Further Information
An iterative algorithm of polynomial complexity is presented that solves a max-min fairness problem which is often encountered while dealing with traffic routing or capacity allocation problems. The algorithm does not depend on any specific traffic routing problem formulation and is sufficiently general to be applied to a broad class of traffic routing and capacity allocation problems. The correctness of the algorithm and its complexity are formally proved.