New Algorithm for the Generalized Max-Min Fairness Policy Based on Linear Programming

Ioannis D. MOSCHOLIOS  Michael D. LOGOTHETIS  

Publication
IEICE TRANSACTIONS on Communications   Vol.E88-B   No.2   pp.775-780
Publication Date: 2005/02/01
Online ISSN: 
DOI: 10.1093/ietcom/e88-b.2.775
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
Keyword: 
max-min fairness,  bandwidth allocation,  elastic traffic,  linear programming,  centralized control,  

Full Text: PDF>>
Buy this Article




Summary: 
The Generalized Max-Min Fairness policy (GMM) allocates in a fair way the available bandwidth among elastic calls by taking into account their minimum and maximum rate requirements. The GMM has been described in a five-step procedure, which has the advantage of an easy presentation, but does not come into details, as far as its computer implementation is concerned, and fails to describe the policy in a clear mathematical way. We propose a new algorithm for the GMM policy, in a clear mathematical way, based on Linear Programming (LP). The new algorithm is directly convertible into software. Numerical examples clarify our algorithm.