Utility max-min fair resource allocation for communication networks with multipath routing

Authors:
Jiong Jin;Wei-Hua Wang;Marimuthu Palaniswami
Affiliations:
Department of Electrical and Electronic Engineering, The University of Melbourne, Parkville, VIC. 3010, Australia;Department of Electrical and Electronic Engineering, The University of Melbourne, Parkville, VIC. 3010, Australia;Department of Electrical and Electronic Engineering, The University of Melbourne, Parkville, VIC. 3010, Australia
Venue:
Computer Communications
Year:
2009

Citing 12
Cited 1

Data networks

Data networks
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic

IEEE/ACM Transactions on Networking (TON)
Optimal flow control and routing in multi-path networks

Performance Evaluation - Special issue: Internet performance and control of network systems
Non-convex optimization and rate control for multi-class services in the Internet

IEEE/ACM Transactions on Networking (TON)
Computing optimal max-min fair resource allocation for elastic flows

IEEE/ACM Transactions on Networking (TON)
Application-oriented flow control: fundamentals, algorithms and fairness

IEEE/ACM Transactions on Networking (TON)
End-to-end optimal algorithms for integrated QoS, traffic engineering, and failure recovery

IEEE/ACM Transactions on Networking (TON)
Distributed rate allocation for inelastic flows

IEEE/ACM Transactions on Networking (TON)
A scalable low-overhead rate control algorithm for multirate multicast sessions

IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet

IEEE Journal on Selected Areas in Communications

Rate control for heterogeneous wireless sensor networks: Characterization, algorithms and performance

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.24

Visualization

Abstract

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 of deciding the optimal routing strategy and distributing the total traffic evenly out of the available paths. The performance of our utility max-min fair flow control algorithm is evaluated through simulations under two representative case studies, as well as the real implementation issues are addressed deliberately for the practical purpose.