Applications of the max-min fairness principle in telecommunication network design

Pióro, Michał; Dzida, Mateusz; Kubilinskas, Eligijus; Nilsson, P.

doi:10.1109/ngi.2005.1431669

Cited by 11 publications

(10 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…General issues on MMF are also discussed in [18]. More applications of the MMF solutions in telecommunication network design can be found in [19][20][21].…”

Section: Relation With Previous Workmentioning

confidence: 99%

Optimization of link load balancing in multiple spanning tree routing networks

et al. 2010

View full text Add to dashboard Cite

In telecommunication networks based on the current Ethernet technology, routing of traffic demands is based on multiple spanning trees: the network operator configures different routing spanning trees and assigns each demand to be routed in one of the selected spanning trees. A major optimization issue in this solution is the combined determination of (i) a set of appropriate spanning trees, and (ii) assignment of demands to the trees, in order to achieve an optimal load balancing on the links of the network. In this paper we consider models and solving techniques for lexicographical optimization of two load balancing objective functions. The first objective is the min-max optimization of the n worst link loads (with n up to the total number of network links), and the second objective is the minimization of the average link load (when n is smaller than the total number of network links). Besides exact methods, a heuristic technique that can compute both feasible solutions and lower bounds for the addressed optimization problem is proposed. Finally, we discuss effectiveness of different solution using results of a numerical study of realistic case studies.

show abstract

“…General issues on MMF are also discussed in [18]. More applications of the MMF solutions in telecommunication network design can be found in [19][20][21].…”

Section: Relation With Previous Workmentioning

confidence: 99%

Optimization of link load balancing in multiple spanning tree routing networks

et al. 2010

View full text Add to dashboard Cite

show abstract

“…In particular, we discuss lexicographic allocation in this paper. A recent work [20] describes the lexicographic optimization in the context of telecommunication networks but does not consider a discrete set.…”

Section: Background Notation and Preliminariesmentioning

confidence: 99%

Lexicographic Fairness in WDM Optical Cross-Connects

Mohanty

Bhuyan

2007

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Abstract-We consider fair allocation of sessions at the outputs of optical cross-connects employing wavelength division multiplexing (WDM). Each session consists of traffic on one or more wavelengths (channels). We identify lexicographic fairness as the most appropriate fairness criterion that is relevant to this setting. Achieving a fair lexicographic solution, commonly referred to as lexicographic optimality (LEX), is trivial and polynomial-time computable when any incoming wavelength can be converted to any outgoing wavelength (full conversion). This is not apparent in the practical and realistic case of limited conversion. We prove that LEX is also polynomial-time computable for the limited conversion case by reducing the problem to a min-cost maxflow optimization objective in network flows. We also motivate, formulate and solve a stronger variant of lexicographic optimality that we refer to as worst-case fair lexicographic optimal (W-LEX). Although our effective setting is an optimization problem in bipartite graphs (the request graph is bipartite), the networkflow based algorithms are applicable to unit capacity graphs in general. Further, we provide fast polynomial-time algorithms that furnish solutions for LEX and the W-LEX optimality problems for arbitrary bipartite graphs (i.e. arbitrary wavelength-conversion rules) and are computationally less expensive than network-flow methods. Finally we report simulation results to validate our findings.

show abstract

“…General issues on MMF are also discussed in [12]. More applications of the MMF solutions in telecommunication network design can be found in [13], [14], [15].…”

Section: Introductionmentioning

confidence: 99%

“…Following the previous selected order (line 3), a minimum cost path is computed for each k (line 12) and the bandwidth of k is added to the load of the edges of the minimum cost path (lines [13][14]. To compute the minimum cost path (line 12), we use the well known Dijkstra algorithm.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Link load balancing optimization of telecommunication networks: A column generation based heuristic approach

Santos

Sousa

Alvelos

et al. 2010

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)

View full text Add to dashboard Cite

Abstract-This paper deals with optimal load balancing in telecommunication networks. For a capacitated telecommunications network with single path routing and an estimated traffic demand matrix, we wish to determine the routing paths aiming at min-max optimization of link loads. To solve this problem, we propose a column (path) generation based heuristic. In the first step, we use column generation to solve a linear programming relaxation of the basic problem (obtaining a lower bound and a set of paths). In the second step, we apply a multi-start local search heuristic with path-relinking to the search space defined by the paths found in the first step. In order to assess the merits of this approach, we also implemented a search heuristic which is equivalent to the second step of the proposed one but with no constraints on the set of paths that can be used. Through a set of computational results, we show that the proposed heuristic is efficient in obtaining near optimal routing solutions within short running times. Moreover, the comparison of the two heuristics show that constraining the search space to the columns given by column generation gives better results since this solution space contains good quality solutions and, due to its size, enables to find them in short running times.

show abstract

Applications of the max-min fairness principle in telecommunication network design

Cited by 11 publications

References 12 publications

Optimization of link load balancing in multiple spanning tree routing networks

Optimization of link load balancing in multiple spanning tree routing networks

Lexicographic Fairness in WDM Optical Cross-Connects

Link load balancing optimization of telecommunication networks: A column generation based heuristic approach

Contact Info

Product

Resources

About