View article

An iterative algorithm of polynomial complexity is presented that solves a max‐min fairness problem which is often encountered while dealing with traffic routing or capacity allocation problems. The algorithm does not depend on any specific traffic routing problem formulation and is sufficiently general to be applied to a broad class of traffic routing and capacity allocation problems. The correctness of the algorithm and its complexity are formally proved. Copyright © 2005 AEIT.