Lexicographic maximin optimisation for fair bandwidth allocation in computer networks

This paper addresses the problem of bandwidth allocation in multi-application computer network environments. Allocations are determined from the solution of a multiple objective optimisation problem under network constraints, where the lexicographic maximin criterion is applied to solve the problem and guarantees fairness and efficiency properties to the solution. An algorithm based on a series of maximum concurrent multicommodity flow subproblems is proposed. Numerical results show the advantage of the approach compared to other traditional bandwidth allocation solutions.