Utility max-min fair resource allocation for communication networks with multipath routing
Jiong Jin, Wei-Hua Wang, Marimuthu Palaniswami
COMPUTER COMMUNICATIONS | ELSEVIER | Published : 2009
This paper considers the flow control and resource allocation problem as applied to the generic multipath communication networks with heterogeneous applications. We propose a novel distributed algorithm, show and prove that among all the sources with positive increasing and bounded utilities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential for balancing Quality of Service (QoS) for different applications. By combining the first order Lagrangian method and filtering mechanism, the adopted approach eliminates typical oscillation behavior in multipath networks and possesses a rapid convergence property. In addition, the algorithm is capable o..View full abstract
Related Projects (2)
Awarded by Australian Research Council
This work was supported by the Australian Research Council under Grant Nos. DP0985322 and DP0559131, and ARC Research Networks on Intelligent Sensors, Sensor Networks and Information Processing.