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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Ameur, W., Kerivin, H.: Routing of Uncertain Traffic Demands. Optim. Eng. 6, 283–313 (2005)
Botton, Q., Fortz. B., Gouveia, L., Poss, M.: Benders decomposition for the hop constrained survivable network design problem. CIO working paper (March 2010)
Dahl, G., Gouveia, L., Requejo, C.: On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunications, pp. 493–515. Springer, Heidelberg (2006)
Gouveia, L.: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. INFORMS J. Comput. 10, 180–188 (1998)
Gouveia, L., Patrício, P.F., de Sousa, A.F.: Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM. Netw. Spat. Econ. 8(1), 3–21 (2008)
Gouveia, L., Patrício, P.F., de Sousa, A.F.: Optimal Survivable Routing with a Small Number of Hops. In: Raghavan, S., Golden, G., Wasil, E. (eds.) Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces Book Series, vol. 44, pp. 253–274. Springer, Heidelberg (2008)
Gouveia, L., Patrício, P.F., de Sousa, A.F.: Models for Optimal Survivable Routing with a Minimum Number of Hops: Comparing Disaggregated with Aggregated Models. Int. Trans. Oper. Res. (2011), doi: 10.1111/j.1475-3995.2010.00766.x
Huygens, D., Labb, M., Mahjoub, A.R., Pesneau, P.: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Netw 49(1), 116–133 (2007)
Juttner, A., Szviatovski, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the QoS routing problem. In: Infocom Proc., vol. 2, pp. 859–868 (2001)
Kerivin, H., Mahjoub, A.R.: Design of Survivable Networks: A Survey. Netw. 46(1), 1–21 (2005)
Nace, D., Pióro, M.: Max-Min Fairness And Its Applications to Routing and Load-Balancing in Communication Networks: A Tutorial. IEEE Surv. and Tutor. 10(4), 5–17 (2008)
Ogryczak, W., Milewski, M., Wierzbicki, A.: Fair and Efficient Bandwidth Allocation with the Reference Point Methodology. In: INOC Proc. (2007)
Orda, A.: Routing with end to end QoS guarantees in broadband networks. IEEE/ACM Trans. Netw. 7(3), 365–374 (1999)
Orlowski, S., Wessaely, R.: The Effect of Hop Limits on Optimal Cost in Survivable Network Design. In: Raghavan, S., Anandalingam, G. (eds.) Telecommunications Network Planning: Innovations in Pricing, Network Design and Management. Operations Research/Computer Science Interfaces Book Series, vol. 33, pp. 151–166. Springer, Heidelberg (2006)
Parekh, A., Gallager, R.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. IEEE/ACM Trans. Netw. 2(2), 137–150 (1994)
Radunovic, B., Le Boudec, J.-Y.: A Unified Framework for Max-min and Min-max Fairness with Applications. IEEE/ACM Trans. Netw. 15(5), 1073–1083 (2007)
Santos, D., de Sousa, A., Alvelos, F., Pióro, M.: Link Load Balancing Optimization of Telecommunication Networks: a Column Generation based Heuristic Approach. In: Int. Telecommun. In: Netw. Strategy Plan. Symp. Proc., pp. 1–6 (2010)
Yuan, X.: Heuristic Algorithms for multiconstrained quality-of-service routing. IEEE/ACM Trans. Netw. 10(2), 244–256 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gouveia, L., Patrício, P., de Sousa, A. (2011). Lexicographical Minimization of Routing Hops in Telecommunication Networks. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)