Routing-Independent Fairness in Capacitated Networks

The problem of fair and feasible allocation of user throughputs in capacitated networks is investigated. The main contribution of the paper is an extension of network fairness, and in particular, max-min fairness from the traditional "fixed- path" model to a more versatile, routing-independent model. We show that the set of throughput configurations realizable in a capacitated network makes up a polyhedron, which gives rise to a max-min fair allocation completely analogous to the conventional case.