Abstract
In this paper, we address a hop-constrained node survivable network design problem that is defined in the context of multi-protocol label switching (MPLS) over wavelength division multiplexing (WDM) networks. At the lower WDM layer, we consider a maximum length constraint for optical connections between MPLS routers. At the upper MPLS layer, we consider survivability as well as maximum delay constraints. Survivability is guaranteed by routing each demand through D node-disjoint paths and maximum delay is guaranteed by constraining all paths to a maximum number of hops. An Integer Linear Programming model, based on the previous works by Gouveia et al. (Proc of IEEE INFOCOM, 2003, and Telecommunications network planning: innovations in pricing, network design and management, pp 167–180, 2006) is used to model the network design problem considering two different survivability mechanisms: path diversity (where each demand is equally split over the D paths) and path protection (where any D–1 out of the D paths have enough capacity to support the total demand). For both mechanisms, we use the NSFNet and EON real world networks to make a cost analysis of the design solutions for different values of D. In the path diversity mechanism, the results consistently show that greater values of D impose a cost penalty that is greater than the gain in the percentage of demand that is protected. In the path protection mechanism, where all traffic is totally protected, the results show that the network solutions obtained with D=3 node-disjoint paths have consistently lower costs than the network solutions obtained with D=2 node-disjoint paths. However, using values of D that are greater than 3 led to network solutions with larger costs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balakrishnan A, Altinkemer K (1992) Using a hop-constrained model to generate alternative communication network design. ORSA J Comput 4(1):92–205
Balakrishnan A, Magnanti TL, Mirchandani P (2004) Connectivity-splitting models for survivable network design. Networks 43:10–27
Borne S, Gourdin E, Liau B, Mahjoub AR (2006) Design of survivable IP-over-optical networks. Ann Oper Res 146(1):41–73
Gouveia L (1998) Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J Comput 10:180–188
Gouveia L, Patrício P, de Sousa A, Valadas R (2003) MPLS over WDM network design with packet level QoS constraints based on ILP models. In: Proc of IEEE INFOCOM, San Francisco, April, 2003
Gouveia L, Patrício PF, Sousa AF (2006) Compact models for hop-constrained node survivable network design. In: Anandaligam G, Raghavan S (eds) Telecommunications network planning: innovations in pricing, network design and management. Springer, Berlin Heidelberg New York, pp 167–180
Huygens D, Mahjoub AR, Pesneau P (2005) Two edge-disjoint hop-constrained paths and polyhedra. SIAM J Discrete Math 18(2):287–312
Huygens D, Labbé M, Mahjoub AR, Pesneau, P (2004) Two edge-disjoint hop-constrained paths: valid inequalities and branch-and-cut. Paper presented at Optimization 2004, Lisbon, 2004
Koster A, Zymolka A, Jager M, Hulsermann R (2005) Demand-wise shared protection for meshed optical networks. J Netw Syst Manag 13(1):35–55
LeBlanc L, Chifflet J, Mahey P (1999) Packet routing in telecommunication networks with path and flow restrictions. INFORMS J Comput 11:188–197
Magnanti T, Raghavan S (2005) Strong formulations for network design problems with connectivity requirements. Networks 45(2):61–79
Magnanti TL, Mirchandani P, Vachani R (1995) Modeling and solving the two-facility capacitated network loading problem. Oper Res 43:142–157
Mannie E (2004) Generalized multi-protocol label switching (GMPLS) architecture. RFC 3945. Internet Engineering Task Force, Sterling
Orlowski S, Wessaely R (2006) The effect of hop limits on optimal cost in survivable network. In: Anandaligam G, Raghavan S (eds) Telecommunications network planning: innovations in pricing, network design and management. Springer, Berlin Heidelberg New York, pp 151–166
Raghavan S (1995) Formulations and algorithms for network design problems with connectivity requirements. Ph.D thesis, MIT, Cambridge
Raghavan S, Magnanti TL (1997) Network connectivity. In: Dell’Amico M, Maffiolli F, Martello S, (eds.) Annotated bibliographies in combinatorial optimization. Wiley, New York, pp 335–354
Ramaswami R, Sivarajan KN (2002) Optical networks: a practical perspective, 2nd edn. Morgan-Kaufmann, San Mateo
Sharma V, Hellstrand F (2003) Framework for multi-protocol label switching (MPLS)-based recovery. RFC 3469. Internet Engineering Task Force, Sterling
Stoer M (1992) Design of survivable networks. Lecture notes in mathematics, No. 1531, Springer, Berlin Heidelberg New York
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by FCT project POCTI - ISFL - 1- 152.
Rights and permissions
About this article
Cite this article
Gouveia, L., Patrício, P. & de Sousa, A. Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM. Netw Spat Econ 8, 3–21 (2008). https://doi.org/10.1007/s11067-007-9038-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11067-007-9038-3