Constraint precedence in max-min fair rate allocation

Abstract

This paper proves a tight lower and upper bound for the convergence of max-min rate allocation protocols for connection-oriented networks. The theory is based on the concept of a constraint precedence graph. The analysis and simulation results show that the previously known convergence time estimates are too pessimistic.