Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

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.

[1]  M. Stoer.  Design of Survivable Networks , 1993 .

[2]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[3]  Amaro de Sousa,et al.  Compact Models for Hop-Constrained Node Survivable Network Design: An Application to MPLS , 2006 .

[4]  Larry J. LeBlanc,et al.  Packet Routing in Telecommunication Networks with Path and Flow Restrictions , 1999, INFORMS J. Comput..

[5]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective, 3rd Edition , 2009 .

[6]  S. Raghavan,et al.  Formulations and algorithms for network design problems with connectivity requirements , 1995 .

[7]  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..

[8]  G. Swallow.  MPLS advantages for traffic engineering , 1999, IEEE Commun. Mag..

[9]  Thomas L. Magnanti,et al.  Connectivity–splitting models for survivable network design , 2004 .

[10]  Arie M. C. A. Koster,et al.  Demand-wise Shared Protection for Meshed Optical Networks , 2005, Journal of Network and Systems Management.

[11]  Marco Listanti,et al.  Off-line configuration of a MPLS over WDM network under time-varying offered traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

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

[14]  S. Raghavan,et al.  Strong formulations for network design problems with connectivity requirements , 2005 .

[15]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[16]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[17]  Ali Ridha Mahjoub,et al.  Design of survivable IP-over-optical networks , 2006, Ann. Oper. Res..

[18]  Luís Gouveia,et al.  MPLS over WDM network design with packet level QoS constraints based on ILP models , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[20]  Armando N. Pinto,et al.  Optical Networks: A Practical Perspective, 2nd Edition , 2002 .

[21]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[22]  Thomas L. Magnanti,et al.  Modeling and Solving the Two-Facility Capacitated Network Loading Problem , 1995, Oper. Res..

[23]  Ali Ridha Mahjoub,et al.  Two Edge-Disjoint Hop-Constrained Paths and Polyhedra , 2005, SIAM J. Discret. Math..

[24]  Murali S. Kodialam,et al.  Integrated dynamic IP and wavelength routing in IP over WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[25]  Kemal Altinkemer,et al.  Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..

[26]  Ali Ridha Mahjoub,et al.  Two Edge-Disjoint Hop-Constrained Paths: Valid Inequalities and Branch-and-Cut , 2005 .