An Upward Max-Min Fairness Multipath Flow Control

Many rate allocation algorithms for multipath flows which satisfy max-min fairness are centralized and not scalable. Upward max-min fairness is a well-known relaxation of max-min fairness and can be achieved by an algorithm extended from water-filling algorithm. In this paper, we propose a price-based multipath congestion control protocol whose equilibrium point satisfies upward max-min fairness. Our protocol is derived from a network utility maximization model for multipath flows.