Utility max-min fair flow control for multipath communication networks
Jiong Jin, Weihua Wang, Marimuthu Swami Palaniswami · Swinburne figshare (Swinburne University of Technology) · 2007
Abstract — This paper considers flow control and resource allo-cation problem as applied to multipath communication networks. We propose a novel distributed algorithm, show and prove that among all the sources with generic increasing and bounded util-ities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential in providing application QoS (Quality of Service) guarantee. In addition, by combining a first order Lagrangian method and filtering mechanism, the resulted approach eliminates typical oscillating behavior for the multipath network and possesses a rapid convergence property. I.