Lexicographical minimization of routing hops in telecommunication networks

Authors:
Luís Gouveia;Pedro Patrício;Amaro De Sousa
Affiliations:
CIO and DEIO, Faculdade de Ciências da Universidade de Lisboa, Lisboa, Portugal;CIO and Departamento de Matemática, Universidade da Beira Interior, Covilhã, Portugal;Instituto de Telecomunicações, Universidade de Aveiro, Aveiro, Portugal
Venue:
INOC'11 Proceedings of the 5th international conference on Network optimization
Year:
2011

Citing 8
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks

IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for multiconstrained quality-of-service routing

IEEE/ACM Transactions on Networking (TON)
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

INFORMS Journal on Computing
Design of Survivable Networks: A survey

Networks
The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

Networks - Special Issue on Multicommodity Flows and Network Design
A unified framework for max-min and min-max fairness with applications

IEEE/ACM Transactions on Networking (TON)
Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial

IEEE Communications Surveys & Tutorials

A hybrid column generation with GRASP and path relinking for the network load balancing problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.