Abstract
Consider a given network defined by an undirected graph with a capacity value associated with each edge and a set of traffic commodities that must be routed through the network. Assume that the network contains at least D hop-constrained node disjoint routing paths between the origin and the destination nodes of each commodity. This paper addresses the minimum hop survivability routing problem, i.e., the determination of the routing paths optimizing hop related objective functions applied to the Δminimum hop routing paths of each commodity, where 1≤Δ≤D. We propose ILP formulations addressing two objective functions: the minimization of the average number of hops and the minimization of the maximum number of hops. In both cases, the proposed models let us address two common survivability mechanisms: the case with Δ= D corresponds to the Path Diversity mechanism and the case with Δ= D − 1 corresponds to the Path Protection mechanism. We present computational results using pre-dimensioned networks based on the NSF network for given estimated commodity demands. We study two traffic engineering issues: i) the relationship between the total commodity demand and the optimal values of the objective functions and ii) the impact of demand estimation errors on the feasibility of pre-dimensioned network design solutions. Concerning the efficiency of the proposed formulations, the results show that when Δ = D the proposed models are very efficient in all cases; the results also show that when Δ = D − 1 the proposed models are efficient when the total commodity demand is as much as 97.5% of the network capacity and become harder to solve when total demand reaches the limit of the network capacity.
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
Gouveia, L. E.; Patrício, P.F.; de Sousa, A.F., Hop-Constrained Node Survivable Network Design: an Application to MPLS over WDM, to appear in NETS special issue on telecommunications, related to the INFORMS 2006 Telecom conference.
Gouveia, L., Patrício, P.F., Sousa, A.F., Compact models for hop-constrained node survivable network designIn Telecommunications Network Planning: Innovations in Pricing, Network Design and Management, ed. S. Raghavan and G. Anandaligam, Springer, 2006.
Juttner, A., Szviatovski, B., Mecs, I., Rajko, Z., Lagrange relaxation based method for the QoS routing problem, Proceedings of INFOCOM 2001, Vol. 2, pp. 859-868, 2001.
Koster, A., Zymolka A, Jager, M., and Hulsermann, R., Demand-wise shared protection for meshed optical networks, Journal of Network and Systems Management, Vol. 13, No. 1, pp. 35-55, 2005.
Mannie, E., Generalized Multi-Protocol Label Switching (GMPLS) Architecture, RFC 3945, Internet Engineering Task Force, October 2004.
Orda, A., Routing with end to end QoS guarantees in broadband networks, IEEE /ACM Transactions on Networking, Vol. 7, No. 3, pp. 365-374, 1999.
Ramakrishnan, K. G., Rodrigues, M. A., Optimal routing in shortest-path data networks, Bell Labs Technical Journal, Vol. 6, No. 1, pp. 117-138, 2001.
Sharma, V., Hellstrand, F., Framework for Multi-Protocol Label Switching (MPLS) – based Recovery, RFC 3469, Internet Engineering Task Force, February 2003.
Yuan, X., Heuristic Algorithms for multiconstrained quality-of-service routing, IEEE /ACM Transactions on Networking, Vol. 10, No. 2, pp. 244-256, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gouveia, L., Patrício, P., Sousa, A.d. (2008). Optimal Survivable Routing with a Small Number of Hops. In: Raghavan, S., Golden, B., Wasil, E. (eds) Telecommunications Modeling, Policy, and Technology. Operations Research/Computer Science Interfaces, vol 44. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77780-1_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-77780-1_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77779-5
Online ISBN: 978-0-387-77780-1
eBook Packages: Computer ScienceComputer Science (R0)