View article

Telecommunications networks are facing an increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises, which requires the allocation of bandwidth to maximize service flows with fair treatment for all the services. In such applications, the so-called Max-Min Fairness (MMF) solution is widely used to formulate the resource allocation scheme. It assumes that the worst service performance is maximized, and the solution is additionally regularized with the lexicographic maximization of the second worst performance, the third worst, etc. Because of lexicographic maximization of ordered quantities, the MMF solution cannot be tackled by the standard optimization model. It can be formulated as a sequential lexicographic optimization procedure. Unfortunately, the basic sequential procedure is applicable only for convex models; thus it allows dealing with basic …