Computing Optimal Max-Min Fair Resource Allocation for Elastic Flows - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE/ACM Transactions on Networking Année : 2006

Computing Optimal Max-Min Fair Resource Allocation for Elastic Flows

Résumé

In this paper, we consider the max-min fair resource allocation problem as applied to elastic flows. We are interested in computing the optimal max-min fair rate allocation. The proposed approach is a linear programming based one and allows the computation of optimal routing paths with regard to max-min fairness, in stable and known traffic conditions. We consider non-bounded access rates, but we show how the proposed approach can handle the case of upper-bounded access rates. A proof of optimality and some computational results are also presented
Fichier non déposé

Dates et versions

hal-02157199 , version 1 (15-06-2019)

Identifiants

Citer

Dritan Nace, Nhat-Linh Doan, Eric Gourdin, Bernard Liau. Computing Optimal Max-Min Fair Resource Allocation for Elastic Flows. IEEE/ACM Transactions on Networking, 2006, 14 (6), pp.1272-1281. ⟨10.1109/TNET.2006.886331⟩. ⟨hal-02157199⟩
51 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More