Mathematical Problems in Engineering

Volume 2013, Article ID 920564, 5 pages

http://dx.doi.org/10.1155/2013/920564

## Optimization of -Cycle Placement for Differentiated Levels of Protection

College of Computer and Information Engineering, Inner Mongolian Agricultural University, Hohhot 010018, Inner Mongolia, China

Received 18 May 2013; Accepted 29 July 2013

Academic Editor: William Guo

Copyright © 2013 Hong Hui Li and Xue Liang Fu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

This paper develops a new scalable and efficient model for the design of *p*-cycles with the differentiated levels of node protection. The proposed model allows the indicated level of node survivability ranging from 0% to 100%, which could facilitate a carrier offer node-failure survivability (and hence availability) on a differentiated service basis. To design *p*-cycles, an integer linear program (ILP) is usually formulated with the prerequisite of a prior enumeration of all possible *p*-cycle candidates. A huge number of candidates may exist in a large-scale network. Thus, the resulting ILP becomes intractable. We propose a new design and solution method based on large-scale optimization techniques, known as column generation (CG). With CG, our design method generates *p*-cycle candidates dynamically when needed. Extensive experiments have been conducted for evaluation. The numerical results show that, with the spare capacity used only for link protection, up to 50% node-failure survivability can be achieved for free. Full node protection can be achieved at a marginal cost in comparison with those for link protection only.

#### 1. Introduction

WDM (wavelength division multiplexing) mesh networks are preferred as next generation optical core networks [1]. The WDM technology enables a single fiber to carry up to hundreds of wavelength channels, each of which operates at a speed of several Gbps. Thus, a single network element failure may cause the failure of a number of light paths, which leads to the huge data as well as revenue loss. Survivability therefore is an important requirement in the design of WDM mesh networks.

Different kinds of protection approaches have been proposed for WDM optical mesh networks to ensure survivability from any single failure. Among them, *p*-cycles (short for preconfigured protection cycle) [2] have attracted extensive research interests due to their unique characteristics, that is, fast recovery speed and efficient capacity usage. Most of studies on *p*-cycle-based survivable network design [2–7] only consider protection against a single link failure with no consideration of a single node failure. A single node failure happens less frequently than a single link failure in WDM mesh networks. However, the resulting effects may be catastrophic as a single node failure disrupts all its incident links. Moreover, according to service level agreements, customers may require differentiated levels of node protection. Thus, partial protection of paths from a single node failure may be cost effective and an attractive offering of a differentiated business.

So far, however, very few papers have explored *p*-cycle design with the differentiated levels of node protection. Node-encircling *p*-cycles (NEPC) are proposed in [8] for protection against any single node failure. An enhanced APS for *p*-cycles with node protection is proposed in [9]. Path-segment-protecting *p*-cycles are suggested in [10] for node protection. A very recent finding regarding *p*-cycles for node protection is reported in [11]. In order to keep the simplicity of *p*-cycle protection switching, the authors propose the two-hop-segment strategy for node protection [12] (see Section 2).

To design *p*-cycles with node protection, the conventional way (e.g., [9, 10]) is to formulate the design problem as integer linear program (ILP). The prerequisite for the ILP solution is a prior enumeration of all possible *p*-cycle candidates. The number of *p*-cycle candidates increases exponentially with the increase of network size (the number of links). Thus, the resulting ILP becomes less tractable in large-scale optical networks. If only a subset of *p*-cycles candidates is considered, solution quality may not be guaranteed.

In this paper, we explore *p*-cycle design with the differentiated levels of node protection using the two-hop-segment strategy. The objective is to minimize spare capacity cost such that a network can survive from any single link failure as well as survive from the required level of any single node failure. (Note that for a single node failure, only the working paths passing through it are considered for protection.) In contrast with the protection approach in [12], the proposed approach [13, 14] enhances the *p*-cycle protection capability. A *p*-cycle can protect multiple affected paths upon an intermediate node failure. To deal with the scalability issues suffered in the conventional designs, we develop a new design method based on large-scale optimization tools, namely, column generation (CG). With CG, our proposed design generates *p*-cycle candidates dynamically when needed in the course of the optimization process.

The rest of the paper is organized as follows. Section 2 illustrates the principle of *p*-cycles for node protection. Section 3 presents the CG formulation developed for the design of *p*-cycles with differentiated levels of node protection. Section 4 evaluates the solution performance of the proposed design. Conclusions are made in Section 5.

#### 2. Background

In this section, we illustrate the two-hop-segment strategy for node protection using *p*-cycles. *p*-Cycles are originally proposed for link protection. The very recent study [12] suggests the two-hop-segment strategy, with which *p*-cycles can protect from a single node failure. For an intermediate node of a working path, the related two-hop segment includes two links on the path which are adjacent to the node. If a *p*-cycle protects the two links of a two-hop segment, a *p*-cycle can protect the associated intermediate node in an on-cycle protection manner. In this on-cycle manner, a *p*-cycle provides one protection path for the recovery of one unit traffic through the failed node. If only two end nodes of a two-hop segment are sitting on a *p*-cycle, the *p*-cycle cab offers two protection paths. This protection manner is named as a straddling protection manner.

Figure 1 illustrates the principal of node protection with *p*-cycles, where a demand - is carried on working path ----. For the intermediate node , the associated two-hop segment consists in --. To protect node , the associated *p*-cycle must protect the two-hop segment -- wholly. As shown in Figure 1(a) to Figure 1(d), each *p*-cycle, from to , can be used to protect the intermediate node . Among them, Figure 1(a) to Figure 1(c) show the on-cycle protection manner, while Figure 1(d) shows the straddling protection manner.

#### 3. A Column Generation Model

An optical network is denoted by a graph , where is the set of nodes and is the set of links, indexed by and , respectively.

In order to deal with the scalability issues in the classical design, we develop a column-generation- (CG-) based optimization model. Only a very few number of promising *p*-cycle candidates are generated online as needed in the course of the optimization process. With the CG technique (see, e.g., [15] for basic reference), the original design problem is decomposed into two problems: the master problem and the pricing problem. The master problem chooses *p*-cycles from candidates in order to protect all traffic against a single link failure or a single node failure according to the related quality of protection of node. A *p*-cycle candidate is generated dynamically by the pricing problem in each iteration of the CG algorithm.

##### 3.1. The Master Problem

We denote the number of traffic units on link by . For a given working path , let be the number of connection requests carried on it and let be its intermediate node set. Let be the QoP of the intermediate nodes of the working path .

Candidates are associated with the configuration set . A cycle configuration consists in a cycle that protects a set of links and a set of working paths against the failure of the associated intermediate nodes. A cycle configuration is associated with a vector and a matrix . The element denotes the number of protection paths for link provided by the configuration . The element represents the number of protection paths provided by configuration for working path against the failure of its relay node . Let be the spare capacity cost of configuration , which relies on the number of the on-cycle links.

Variables denote the number of configuration copies that are selected in the current solution. The design objective is to minimize the total spare capacity usage to protect all links as well as meet the required QoP for nodes.

The mathematical model can then be written as follows:

Constraints (2) ensure that all traffic units are protected against any single link failure. Constraints (3) ensure that all demands are protected against a single node failure according to the associated level of QoP. Constraints (4) are variable domain constraints.

##### 3.2. The Pricing Problem

The pricing problem corresponds to the optimization problem for generation of the promising *p*-cycle candidates. The pricing problem is the same as the one in [13, 14] as the same protection approach is adapted for node protection with *p*-cycles. The objective is to minimize the so-called reduced cost of the master problem and subject to sets of constraints.

The reduced cost can be written as follows: where and are dual variables associated with constraints (2) and constraints (3), respectively.

Let us next define the following notations.

*Sets and Parameters.* is the set of links adjacent to a node . is the set of links with one end node in the set but the other end node not. is the set of working paths going through node . if link is adjacent to node and on path ; 0 otherwise. and are two end nodes of the 2-hop segment defined by working path and its relay node .

*Variables.* if link sits on the current cycle; 0 otherwise. if link straddles the current cycle; 0 otherwise. if node belongs to the current cycle; 0 otherwise. if link is used to protect a path against the failure of its relay node ; 0 otherwise.

With these notations, the objective function of the pricing problem can then be written as follows:

Regarding constraints, there are two parts in the pricing problem. The first part defines a cycle, while the second part identifies the associated intermediate nodes of the working paths which can be protected by the current cycle.

In the following, the first part of constraints is presented:

Constraints (7) ensure that an on-cycle node holds two incident links on the cycle. Constraints (8) and (9) say that a link is a straddling link if the link is with two on-cycle end nodes but itself is not. Constraints (10) forbid generating a configuration with multiple cycles. Otherwise, it may complicate the determination of straddling links.

The second part of the constraints is next presented as follows:

Constraints (11) say that only on-cycle links are eligible for protecting the intermediate nodes of the working path . Constraints (12) say that a link cannot be used by the associated protection paths if the link is adjacent to the intermediate node of the working path . Constraints (13)–(15) are flow conservation constraints for defining the associated protection paths. The failure of a node affects all working paths through it. Constraints (16) say that, among them, only a disrupted working path can be recovered. The final set of constraints is variable domain constraints.

#### 4. Computational Results

In this section, we evaluate the solution performances of our proposed design experimentally. Two metrics are exploited for evaluation, which include capacity redundancy (the ratio of spare capacity to working capacity [9]) and the average size (the average number of links) of the *p*-cycles selected in the final solution. Both design methods are implemented in C++ and solved by IBM CPLEX solver.

##### 4.1. Date Instances

Four test networks are presented in Table 1. For each network, we provide network name, the number of nodes, the number of links, and the node degree for approximately representing connectivity. Also, we list the number of demands carried on each network and the associated working capacity cost. Each element in the associated traffic matrices represents the number of requests between each node pair, which is uniformly distributed on the interval .

##### 4.2. Experimental Comparison

Experimental results regarding capacity redundancy and the average size of the *p*-cycles are shown in Figure 2. In Figure 2(a), for the indicated network instance, each bar corresponds to the capacity redundancy of an optimal solution for the indicated level of node-failure recovery ratio (i.e., values). Experimental results reveal that, with our proposed QoP design, *p*-cycles can provide 100% node-failure survivability (i.e., ) at marginal additional redundant spare capacity compared with those only for link protection (), which ranges from ~1% to ~15%. The denser the network is, the less the redundant spare capacity is required for full node protection compared with that only for link protection. In addition, we can observe that, with the same spare capacity as the *p*-cycles designed for link protection, 25% node-failure survivability can be achieved for free for each network instance. For GERMANY and COST239, up to 50% node-failure survivability can be achieved with the spare capacity used for the provision of link-protecting *p*-cycles.

Figure 2(b) shows the solution structure of the QoP *p*-cycle design, where each bar indicates the average number of links of optimally selected *p*-cycles for the indicated network instance and the indicated level of node-failure survivability. We can observe that, for network instance GERMANY, the higher the level of node-failure survivability is, the larger the average size of *p*-cycles is. However, the trends do not appear in network instances NJLATA and BELLCORE. For the instance COST239, due to its high density of the network topology, there are many chances existing to build the same size (the same number) of *p*-cycles while holding a different node-protection capability. As a result, the average size of optimally designed *p*-cycles keeps invariable upon the QoP level ( value) no more than 75%.

#### 5. Conclusion

In this paper, we investigated the design of *p*-cycles with the differentiated levels of the node-failure survivability in WDM mesh networks. The main goal is to develop a capacity-efficient and scalable design method. Our proposed design method enhances the *p*-cycle protection capabilities. A *p*-cycle can protect multiple affected paths upon a node failure. In order to manage the scalability issue suffered in the conventional design method, this paper exploited the large-scale optimization techniques, that is, column generation (CG). Based on CG, our proposed method generates the *p*-cycle candidates dynamically as needed in the course of the optimization process.

Extensive experiments have been conducted. Experimental results show clearly that, with our proposed design method, *p*-cycles can provide full node protection at a marginal additional redundant capacity compared with those for link protection only. For some instances, up to 50% node-failure survivability can be achieved for free with spare capacity used only for link protection.

#### References

- T. E. Stern and K. Bala,
*Multiwavelength Optical Networks: A Layered Approach*, Prentice-Hall, 1999. - W. D. Grover and D. Stamatelakis, “Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration,” in
*Proceedings of the IEEE International Conference on Communications (ICC '98)*, vol. 1, pp. 537–543, June 1998. View at Scopus - D. A. Schupke, C. G. Gruber, and A. Autenrieth, “Optimal configuration of
*p*-cycles in WDM networks,” in*Proceedings of the International Conference on Communications (ICC '02)*, vol. 5, pp. 2761–2765, May 2002. View at Scopus - L. Chang and R. Lu, “Finding good candidate cycles for efficient
*p*-cycle network design,” in*Proceedings of the 13th International Conference on Computer Communications and Networks (ICCCN '04)*, pp. 321–326, October 2004. View at Scopus - C. Rocha and B. Jaumard, “Revisiting
*p*-cycles / FIPP*p*-cycles vs. shared link / path protection,” in*Proceedings of the 17th International Conference on Computer Communications and Networks (ICCCN '08)*, pp. 447–452, August 2008. View at Publisher · View at Google Scholar · View at Scopus - K. Lo, D. Habibi, Q. V. Phung, A. Rassau, and H. N. Nguyen, “Efficient
*p*-cycles design by heuristic*p*-cycle selection and refinement for survivable WDM mesh networks,” in*Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '06)*, pp. 1–5, December 2006. View at Publisher · View at Google Scholar · View at Scopus - B. Wu, K. L. Yeung, and P. Ho, “ILP formulations for
*p*-cycle design without candidate cycle enumeration,”*IEEE/ACM Transactions on Networking*, vol. 18, no. 1, pp. 284–295, 2010. View at Publisher · View at Google Scholar · View at Scopus - D. Stamatelakis and W. D. Grover, “IP layer restoration and network planning based on virtual protection cycles,”
*IEEE Journal on Selected Areas in Communications*, vol. 18, no. 10, pp. 1938–1949, 2000. View at Publisher · View at Google Scholar · View at Scopus - D. A. Schupke, “Automatic protection switching for
*p*-cycles in WDM networks,”*Optical Switching and Networking*, vol. 2, no. 1, pp. 35–48, 2005. View at Publisher · View at Google Scholar · View at Scopus - G. Shen and W. D. Grover, “Extending the
*p*-cycle concept to path segment protection for span and node failure recovery,”*IEEE Journal on Selected Areas in Communications*, vol. 21, no. 8, pp. 1306–1319, 2003. View at Publisher · View at Google Scholar · View at Scopus - D. P. Onguetou and W. D. Grover, “A new insight and approach to node failure protection with ordinary
*p*-cycles,” in*Proceedings of the IEEE International Conference on Communications (ICC '08)*, pp. 5145–5149, May 2008. View at Publisher · View at Google Scholar · View at Scopus - W. D. Grover and D. P. Onguetou, “A new approach to node-failure protection with span-protecting
*p*-cycles,” in*Proceedings of the 11th International Conference on Transparent Optical Networks (ICTON '09)*, pp. 1–5, July 2009. View at Publisher · View at Google Scholar · View at Scopus - B. Jaumard and H. Li, “Design of
*p*-cycles for full node protection in WDM Mesh networks,” in*Proceedings of the IEEE International Conference on Communications (ICC '11)*, pp. 1–5, June 2011. View at Publisher · View at Google Scholar · View at Scopus - H. Li,
*p*-cycle based protection in WDM mesh networks [Ph.D. dissertation], Concordia University, 2013. - V. Chvátal,
*Linear Programming*, Freeman,, New York, NY, USA, 1983. View at Zentralblatt MATH · View at MathSciNet - R. Hlsermann, “A set of typical transport network scenarios for network modelling,” Tech. Rep., Beitrge zur 5. ITG-Fachtagung Photonische Netze, Leipzig, Germany, 2004. View at Google Scholar
- K. Murakami and H. S. Kim, “Comparative study on restoration schemes of survivable ATM networks,” in
*Proceedings of the 16th IEEE Annual Conference on Computer Communications (INFOCOM '97)*, pp. 345–352, IEEE Computer Society, Washington, DC, USA, April 1997. View at Scopus - P. Batchelor et al., “Ultra high-capacity optical transmission networks: final report of action COST 239,” Tech. Rep., Faculty of Electrical Engineering and Computing, University of Zagreb, 1999. View at Google Scholar