Application of the max-min fairness principle in telecommunication network design
Publikation/Tidskrift/Serie: Next Generation Internet Networks, 2005
Förlag: IEEE Press
The rapid growth of traffic induced by Internet services makes the simple over-provisioning of resources not economical and hence imposes new requirements on the dimensioning methods. Therefore, the problem of network design with the objective of minimizing the cost and at the same time solving the tradeoff between maximizing the service data flows and providing fair treatment of all demands becomes more and more important. In this context, the so-called max-min fair (MMF) principle is widely considered to help finding reasonable bandwidth allocation schemes for competing demands. Roughly speaking, MMF assumes that the worst service performance is maximized, and then is the second worst performance, the third one, and so on, leading to a lexicographically maximized vector of sorted demand bandwidth allocations. It turns out that the MMF optimal solution cannot be approached in a standard way (i.e., as a mathematical programming problem) due to the necessity of lexicographic maximization of ordered quantities (bandwidth allocated to demands). Still, for convex models, it is possible to formulate effective sequential procedures for such lexicographic optimization. The purpose of the presented paper is three-fold. First, it discusses resolution algorithms for a generic MMF problem related to telecommunications network design. Second, it gives a survey of network design instances of the generic formulation, and illustrates the efficiency of the general algorithms in these particular cases. Finally, the paper discusses extensions of the formulated problems into more practical (unfortunately non-convex) cases, where the general for convex MMF problems approach fails.
- Technology and Engineering
- to be added
1st Euro-NGI Conference on Next Generation Internet Networks
- ISBN: 0-7803-8900-X