Lexicographical Minimization of Routing Hops in Telecommunication Networks

Consider a telecommunications network with given link capacities and a set of commodities with known demands that must be routed over the network. We aim to determine a single routing path for each commodity such that the whole set of paths does not violate the link capacities and the number of routing hops is minimized in a lexicographical sense, i.e., minimizing the number of paths with the worst number of hops; then, among all such solutions, minimizing the number of paths with the second worst number of hops; and so on.We present two approaches for solving this problem. The first approach is iterative where a sequence of hop constrained problems is solved and the optimal solution value of each iteration defines a new constraint added to the problems of subsequent iterations. The second approach is based on defining a single integer programming model for the whole problem. In this approach, we consider appropriate cost parameters associated with the number of hops of each routing path such that the cost of a path with h hops is higher than the cost of all paths with h-1 hops. In both cases, we propose multi-commodity flow and hop-indexed models and compare them both in terms of linear programming relaxation values and in terms of efficiency.

[1]  Amaro de Sousa,et al.  Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM , 2008 .

[2]  Dritan Nace,et al.  Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial , 2008, IEEE Communications Surveys & Tutorials.

[3]  Sebastian Orlowski,et al.  The Effect of Hop Limits on Optimal Cost in Survivable Network Design , 2006 .

[4]  Luís Gouveia,et al.  Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..

[5]  Jean-Yves Le Boudec,et al.  A unified framework for max-min and min-max fairness with applications , 2007, TNET.

[6]  Michal Pioro,et al.  Link load balancing optimization of telecommunication networks: A column generation based heuristic approach , 2010, 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).

[7]  Xin Yuan.  Heuristic algorithms for multiconstrained quality-of-service routing , 2002, IEEE/ACM Trans. Netw..

[8]  Amaro de Sousa,et al.  Optimal Survivable Routing with a Small Number of Hops , 2008 .

[9]  Amaro de Sousa,et al.  Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models , 2011, Int. Trans. Oper. Res..

[10]  Alpár Jüttner,et al.  Lagrange relaxation based method for the QoS routing problem , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Michael Poss,et al.  Benders Decomposition for the Hop-Constrained Survivable Network Design Problem , 2013, INFORMS J. Comput..

[12]  Hervé Kerivin,et al.  Design of Survivable Networks: A survey , 2005 .

[13]  Martine Labbé,et al.  The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut , 2007 .

[14]  Luís Gouveia,et al.  On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem , 2006, Handbook of Optimization in Telecommunications.

[15]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[16]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

[17]  Ariel Orda.  Routing with end-to-end QoS guarantees in broadband networks , 1999, TNET.