Utility Max-Min Fair Flow Control for Multipath Communication Networks


This paper considers flow control and resource allocation 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 utilities (no need to be concave) in steady state, the utility max-min fairness is achieved, which is essential in providing… (More)


5 Figures and Tables

Slides referencing similar topics