About this Journal Submit a Manuscript Table of Contents
Journal of Computer Networks and Communications
Volume 2012 (2012), Article ID 546301, 10 pages
http://dx.doi.org/10.1155/2012/546301
Research Article

ILP Model and Relaxation-Based Decomposition Approach for Incremental Topology Optimization in p-Cycle Networks

1Department of Mechanical Engineering, University of Alberta, 4-9 Mechanical Engineering Building, Edmonton, AB, Canada T6G 2G8
2Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada T6G 2V4
3TRLabs, Edmonton, AB, T5K 2M5, Canada

Received 14 May 2012; Accepted 7 October 2012

Academic Editor: Maode Ma

Copyright © 2012 Md. Noor-E-Alam et al. 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

p-cycle networks have attracted a considerable interest in the network survivability literature in recent years. However, most of the existing work assumes a known network topology upon which to apply p-cycle restoration. In the present work, we develop an incremental topology optimization ILP for p-cycle network design, where a known topology can be amended with new fibre links selected from a set of eligible spans. The ILP proves to be relatively easy to solve for small test case instances but becomes computationally intensive on larger networks. We then follow with a relaxation-based decomposition approach to overcome this challenge. The decomposition approach significantly reduces computational complexity of the problem, allowing the ILP to be solved in reasonable time with no statistically significant impact on solution optimality.

1. Introduction

High-availability networks have become integral to our everyday lives, used for banking, financial transactions, voice and data communications, entertainment, and so forth. While much effort has been made to make them as reliable as possible, failures and, more critically, service outages still occur with alarming frequency. The vast majority of such failures are a result of fibre cuts, with most of those failures due to cable digups and similar construction accidents [1].

As the frequency of failures has increased, researchers have developed many approaches for ensuring survivability of the network even in the face of cable cuts or other equipment failures, including a number of mechanisms that allow the network to actively respond to a failure by rerouting affected traffic onto one or more backup routes. Survivability mechanisms are often thought of as being either restoration or protection [2]. Although the differences between the two are often blurred, and some mechanisms can be considered to be either type, the general idea is that restoration techniques are those in which a backup route is formed after failure, while protection techniques are those in which a backup route is formed before failure. Each individual survivability mechanism has its own advantages and disadvantages and requires differing amounts of spare capacity distributed throughout the network to accommodate backup routes.

One particular protection mechanism that has received a lot of attention in recent years is -cycles [3, 4]. A p-cycle is a cyclic structure of preconfigured spare capacity, as illustrated in Figure 1, for example, where a six-span -cycle is shown in the leftmost panel. In the event of failure of an on-cycle span (a span that is a part of the cycle), traffic on the failed span can be rerouted around the surviving portion of the -cycle, as illustrated in middle panel. Each unit of capacity on the -cycle can be used to protect one unit of capacity on each on-cycle span. However, in the event of failure of a straddling span (one whose end nodes are on the -cycle but which is itself not a part of the -cycle), traffic on the failed span can be rerouted around the -cycle in either direction, as illustrated in the rightmost panel. In this case, each unit of capacity on the -cycle can be used to protect two units of capacity on each straddling span of the -cycle. So a single unit capacity copy of the -cycle in Figure 1 (i.e., comprising a single unit of protection capacity on each of the six spans of the -cycle) is capable of protecting a total of twelve units of capacity, one on each of the six on-cycle spans and two each on the three straddling spans.

546301.fig.001
Figure 1: p-cycle protection.

As a special case of -cycle protection, one can use Hamiltonian cycles to provide protection (a Hamiltonian cycle is a cycle that passes through all nodes in the network) [5, 6]. In the most extreme case, a single Hamiltonian cycle of sufficient size can actually protect all single-span failures in the network, as all spans will either be an on-cycle span or a straddling span for that cycle. While this can result in simplified switching scenarios (nodes need only a switch to a single -cycle, rather than localise the failure and make switching decisions for multiple cycles independently), it is merely a special case of -cycle protection. The interested reader can refer to prior literature in [57].

Subsequent work in the literature has extended the -cycle concept to node-encircling -cycles (NEPC) [4], path-segment protecting -cycles [8], failure-independent path-protecting (FIPP) -cycles [9], and two-hop segment node protection -cycles [10]. There has also been a number of network design approaches developed in the past decade. Such approaches can be classified as either spare capacity allocation (SCA) or joint capacity allocation (JCA) approaches. In the typical SCA approach, working routing is performed in advance, often via shortest path routing (but not necessarily so), and restoration routing is performed afterwards through some optimal or near optimal method. The objective is typically to minimize spare capacity requirements such that the network is 100% restorable to single-failure events [11, 12]. In JCA approaches, working routing is performed hand-in-hand with restoration routing; working and spare capacity is jointly minimized such that the network is 100% restorable to single-failure events [13, 14]. In general, JCA is significantly more capacity efficient than SCA. While there have been several heuristic methods developed to design -cycle networks [15], we will focus on integer linear programming (ILP) techniques, which can be classified as either arc-path or node-arc models. Arc-path models derive from the original span-restorable network design model in [16], where working and restoration routing is carried out over a set of preenumerated eligible routes. In contrast to the arc-path approach, node-arc models (also called transhipment models) do not utilize eligible restoration routes [17], rather they are assembled on the fly by the ILP solver.

In addition to -cycles, many other survivability schemes have been proposed in the literature, including various automatic protection switching (APS) techniques, span restoration, path restoration, and shared backup path protection (SBPP). Comparative analyses were carried out in [2] to compare and contrast major restoration and protection schemes in terms of capacity efficiency. Although it is perhaps the simplest form of protection available, APS was shown to require considerably greater spare capacity than the other schemes. Span restoration and -cycle protection are the next most costly survivability schemes, with span restoration generally serving as a lower bound on -cycle capacity requirements (in fact, -cycles can be shown to be a special case of span restoration). The end-to-end protection schemes (path restoration and SBPP) are the most capacity efficient, requiring the least amounts of spare capacity. In extreme cases, path restoration can approach zero spare capacity requirements because of stub release (releasing surviving portions of failed working paths to be reused as spare capacity), [2].

In most of the work in the literature, the underlying network topology is known in advance, but there have been several approaches developed that include at least some aspects of an unknown or variable topology in the network design process [1720]. In [19] and [21], the design methods for tree topologies optimization in communication and data networks did not consider restoration or reliability. In [18, 2022] biconnected network topologies were considered as a transition from tree topologies. In [1720], survivability itself was included in the design approach. In these approaches, fixed costs are typically associated with establishment of a span as well as with placement of working and spare capacity on those spans. Fixed establishment costs represent rights-of-way and lease acquisitions, excavation, duct installation, amplifiers, and so forth that are not generally dependent on the capacity or bandwidth of the spans.

Relatively little effort has been made on the investigation of the incremental topology optimization problem. Therefore, the goal of the present work is to develop a JCA -cycle network topology optimization ILP formulation that will minimize the overall design cost (capacity and fixed span establishment costs) of a -cycle network along with its underlying topology such that all single span failures are restorable. Due to the significant computational complexity of this problem (as will be discussed later), we will consider only incremental topology design, where a preexisting initial topology already exists but which is amended through span additions. Even this less complex problem becomes intractable for large networks, and so we further develop a problem-specific relaxation-based decomposition technique to solve this large scale ILP.

The outline of this paper will be as follows: an ILP formulation for topology optimization -cycle design problem is developed in Section 2. It also discusses our experimental setup (i.e., solution approach). Section 3 describes our ILP results. Our problem-specific relaxation-based decomposition technique is proposed and described in Section 4, with results summarized in Section 5. Finally, we wrap up the paper in Section 6 with a concluding discussion.

2. ILP Model

In this section, we present and develop our ILP formulation for incremental topology optimization for -cycle network design problem. Prior to topology optimization ILP models generally make use of the node-arc approach as enumeration of eligible restoration routes becomes a challenging combinatorial problem when the underlying topology is not known; a separate set of eligible routes is needed for every combination of selected eligible spans. And while we will utilize a node-arc approach for our ILP with respect to working routing, our overall approach will be a hybrid, with the -cycle selection placement done via an arc-path approach (i.e., selection from amongst an enumerated set of eligible -cycles). There has been a few notable works in recent literature that develop methods for -cycle network design without enumeration of eligible cycles, [23, 24], but these approaches have proven challenging to incorporate into our topology-optimization ILP. In order to formulate our ILP model, we first define the following notation:: set of all nodes in the network topology, indexed by or ,: set of all -cycles in the network topology, typically indexed by ,: set of all spans in the network topology, typically indexed by or . This includes eligible spans as well as existing spans,: set of all spans incident on node , indexed by or ,: set of all eligible spans that can be added to the network, indexed by or ,: set of all demands in the network, indexed by ,: the parameter that represents the number of demand units for demand ,: the origin node of demand ,: the target node of demand ,: the incremental cost of adding one unit of capacity on span ,: the fixed establishment cost for eligible span ,: a parameter that enumerates eligible -cycles by representing the relationship between span and -cycle , where if it is a straddling span, if it is an on-cycle span, and 0 otherwise,: a decision variable for the number of working capacity units assigned for demand on span and flowing out from node ,: a decision variable for the number of working capacity units assigned for demand on span and flowing into node ,: an integer decision variable for the total amount of working capacity units assigned to span ,: an integer decision variable for the number of spare units deployed on span ,: a binary decision variable that equals 1 if the eligible span will be used in the design, and 0 otherwise,: an integer decision variable that represents the number of copies of -cycle that will be used in this design,: a large number (in our case, the summation of all demands plus one).

Note that strictly speaking, the and decisions variables are integer variables. However, as was shown in [17], as long as the capacity variables themselves are integer, integrality can be relaxed on the underlying flow variables. We then define the problem as follows:

minimize subject to The objective function in (1) seeks to minimize the total cost of the network, including the variable costs incurred for placing working and spare capacity on all spans, and the fixed costs incurred by adding any additional spans to the existing topology (i.e., selecting one or more of the eligible spans). Equations from (2) to (9) are the node-arc constraints that determine working routing and working capacity placement, similar to the approach in [17]. The constraints in (2) ensure that, for any demand, the total number of working capacity units flowing out from the origin node must equal to the number of demand units for this demand, while constraints in (3) ensure that all network flows into the origin node for a particular demand equal zero. Equations (4) and (5) are the related target node constraints. The constraints in (6) ensure the conservation of flow requirement for all transhipment nodes (i.e., not the origin or target nodes) for each demand, while constraints (7) and (8) ensure conservation of flow for all spans (i.e., any traffic flow into a span for a particular demand equals the flow out of that span for that demand). Equation (9) guarantees that the total number of working capacity units deployed on any span will be sufficient to accommodate all of the working traffic routed through it.

Equations (10) and (11) are the arc-path -cycle placement constraints like those in the original -cycle paper, [26]. Constraints in (10) ensure that, for each failed span, the total number protection routes available from -cycles deployed in the network will be sufficient for restoring the working capacity on each span; each copy of a -cycle copy can restore one working capacity on each of its on-cycle spans and two units of working capacity on each of its straddling spans. Constraints in (11) place sufficient spare capacity to accommodate all deployed -cycles. Finally, the constraints in (12) force all span selection variables to equal one if the associated span is assigned any working and/or spare capacity.

3. Experimental Methodology

We used a set of seven test case networks of 10 nodes, 15 nodes, 20 nodes, 25 nodes, 30 nodes, 35 nodes, and 40 nodes. The base networks we used herein (i.e., defining the existing topologies) are the most sparse members of the network families from [2], while their so-called master networks (i.e., those with average nodal degree ) represent the set of eligible spans for each of our respective networks. The set of demands for each of those networks were also used herein; each node pair in a network exchanges a number of lightpaths drawn from a uniform random distribution. While one might argue that demands in reality are not known in advance with any precision and are not static, this treatment of demands is common in the literature, as the demands used can represent upper limits on the expected demands.

Eligible -cycles were enumerated via a custom-designed algorithm that performed a depth-first search type of algorithm to enumerate at least the shortest 10 thousand possible cycles that can be drawn in the graph to protect each single span failure, including eligible spans.

We solved all instances of the problem on an 8-processor ACPI multiprocessor X64-based PC with Intel Xeon CPU X5460 running at 3.16 GHz with 32 GB memory. The ILP models were implemented in AMPL [27] and solved with the CPLEX 11.2 solver [28]. We used a CPLEX mipgap setting of 0.001, which means that all test cases solved to full termination are provably within 0.1% of optimality.

4. Preliminary Result Analysis

Figures 2, 3, 4, 5, 6, 7, and 8 show the relationship between total network design cost and the number of eligible restoration routes with various establishment cost multipliers. Each square, diamond, and triangular data point represents the normalized total cost (working and spare capacity plus fixed span establishment costs) of the network indicated with the specified number of eligible spans and with the specified span establishment cost multiplier. The cost multiplier is the ratio of the spans’ fixed establishment cost to its per-unit capacity cost (i.e., it equals ); the same cost multiplier is applied uniformly on all spans in the network. In our case, we used cost multipliers of 10, 20, and 50, denoted in the charts as low, medium, and high, respectively. We remind the reader that the fixed establishment costs represent rights-of-way costs associated with the span’s fibre facility route, installation of the conduit and fibre cables, and all other one-time costs that might be incurred to establish a new span. The network design cost curves for the medium and high establishment cost factors are not shown for the three larger networks, as problem complexity becomes exceedingly problematic for these test cases (see further discussion below).

546301.fig.002
Figure 2: Total network costs and CPU time versus the number of eligible spans for the 10-node network.
546301.fig.003
Figure 3: Total network costs and CPU time versus the number of eligible spans for the 15-node network.
546301.fig.004
Figure 4: Total network costs and CPU time versus the number of eligible spans for the 20-node network.
546301.fig.005
Figure 5: Total network costs and CPU time versus the number of eligible spans for the 25-node network.
546301.fig.006
Figure 6: Total network costs and CPU time versus the number of eligible spans for the 30-node network.
546301.fig.007
Figure 7: Total network costs and CPU time versus the number of eligible spans for the 35-node network.
546301.fig.008
Figure 8: Total network costs and CPU time versus the number of eligible spans for the 40-node network.

As we expect, the ILP model is better able to perform working and restoration routing and allocate the associated working capacity and -cycles as we introduce more eligible spans, so that overall capacity costs are reduced as the eligible span set gets larger. The rate of the cost reductions varies from network to network, but the trend spears to be that cost reductions slow as the number of eligible spans becomes large. The interpretation here is that as we provide the network with a greater and greater number of eligible spans to select from, it becomes more difficult for the network to make use of these eligible spans.

We can also note that the establishment cost factor does not appear to have a significant bearing on the behaviour of the relationship between network costs and the number of eligible spans. For each network, the differences between the three curves themselves (corresponding to the low, medium, and high establishment cost factors) is primarily due to the fact that the sum of the selected spans’ fixed costs will be larger with a higher establishment cost factor (i.e., the second summation in the objective function), irrespective of the actual number of selected spans. In addition, as will be discussed later, the differences between the three curves are partially a function of the differences in the spans selected by the solver for the various cost factors. However, since the higher establishment cost factors generally result in selection of fewer eligible spans (see the discussion below), this will have a negative effect on the design costs at higher establishment costs. The total network design costs tend to become closer (i.e., the differences between them become less, relatively speaking) as the networks become larger, though this is primarily due to the fact that the capacity costs represent a proportionally greater share of the overall network cost as the networks become larger. In hindsight, this suggests that perhaps our establishment cost multipliers is likely too small to adequately demonstrate the effect that is seen in smaller networks. This should not be interpreted as suggesting that the objective function itself is flawed, rather, there will be a degree of uncertainty in establishment cost factors that will need to be selected based on observed (i.e., actual) costs and perhaps also artificially through a desire to drive rich or sparse topologies (through low cost multipliers and high cost multipliers, resp.).

In any case, the ILP effectively permits a network designer to select an optimal set of span additions (i.e., incremental topology optimization) on which to design a -cycle network. Strictly speaking, this problem is NP-hard [29, 30], but like many NP-hard problems, specific instances are solvable in reasonable times. That is the case for small instances of this problem. However, we can also observe in Figure 2 through Figure 8 that the solution runtimes become prohibitively high for large test case network instances and generally also increase with the number of eligible spans provided to a network. In those figures, the curves with cross (×) data points (read against the right hand side y axes) show the runtime required by the solver when running the corresponding low establishment cost factor results to optimality. Each data point represents the actual processor time used in total amongst all 8 processors (as recorded by CPLEX) to solve the ILP for the indicated test network with the indicated number of eligible spans using the low establishment cost factor (though in most cases, only a single processor was utilized).

As one can observe, runtimes are quite short (from fractions of a second to a few minutes) for the smaller test case networks, but become exceedingly high for larger test case networks reaching nearly 200 thousand seconds (more than two days) for the 40-node network with 78 eligible spans. While there is a general increasing trend in runtimes as we provide a greater number of eligible restoration routes, we can notice that they often exhibit an irregular nature. Although it would be interesting if some useful insight could be gained from this observation, the cause is simply due to peculiarities in the network topologies and the nature of the solution approach. For instance, when the 15-node test case network is solved with 5 eligible spans (Figure 3), inclusion of that 5th eligible span results in the enumeration of a specific set of eligible -cycles which happens to be more computationally complex to solve than the test case with only 4 eligible spans or with 6 eligible spans. It might also be interesting to note that the number of branch-and-bound nodes produced by CPLEX’s internal algorithm rises quite substantially in test cases corresponding to those instances with irregularly high runtimes, suggesting that simple peculiarities in the branch-and-bound tree contribute to these high runtimes. We suspect that the highly irregular nature of CPU times for those test-case networks was due to a complex interaction of the large number of spans in the network and topological effects (addition of a single span can often provide an obviously beneficial routing option that the solver takes advantage of). Such instances of the problem can create much tighter LP relaxations than other instances, and/or algorithms used by CPLEX’s internal branch-and-bound procedures might be better suited to some of those specific cases. As a result, these instances see fewer branch-and-bound nodes when solving the ILP problem. It is these artifacts (i.e., the irregular nature of the runtime increases) in smaller to midsize test case networks, and, more importantly, the extremely high runtimes in the large test case networks that motivate us to develop an alternative solution method for the -cycle network topology optimization problem, as discussed later in Section 5.

A closer look at the numbers of spans selected by the solver adds some additional interesting insights. As we can observe in Figures 9, 10, 11, and 12, the number of spans selected decreases quite as we increase the span establishment cost factor (i.e., as spans become more expensive, relative to the per-unit capacity costs). However, for larger networks there is almost no variation initially (i.e., as we provide only a few eligible spans), regardless of span establishment factor, but a small degree of variation arises when we provide a greater number of eligible spans. While this may initially seem indicative of some underlying phenomenon, the truth of the matter is that we happened to have selected span establishment factors that produce a lopsided objective function that is dominated by the span capacity costs in the larger networks. In hind sight, a smarter approach would have been to set higher stand establishment factors for these larger networks, so that the objective function is more balanced, with respect to the span capacity costs and the fixed establishment costs. With the span establishment factors we have used, the solver sees little disincentive to select quite a large number of the eligible spans (i.e., there is only a small cost to add extra spans, relative to the reductions in capacity that result).

546301.fig.009
Figure 9: Variation of total number of selected spans for 10-node 20-span network.
546301.fig.0010
Figure 10: Variation of total number of selected spans for 15-node 30-span network.
546301.fig.0011
Figure 11: Variation of total number of selected spans for 20-node 40-span network.
546301.fig.0012
Figure 12: Variation of total number of selected spans for 25-node 50-span network.

5. Relaxation-Based Decomposition Technique

In order to be better able to solve the -cycle network topology optimization problem in large test case networks, we now propose and develop a problem-specific relaxation-based decomposition technique for the ILP developed above. From the investigation of a hard ILP instance, it is sometimes observed that the computational complexity arises from a set of constraints or integrality properties of specific sets of variables. For the first scenario, we can dualize these hard constraints and create an easy subproblem [25, 31], and the solution of this subproblem can be used to solve the main problem. Our proposed technique is different from this approach in a sense that we decompose the original problem into two easy subproblems by relaxing the integrality property of some variables rather than relaxing the set of constraints. While most advanced solvers, including CPLEX, utilize some form of relaxation-based approaches to speed up solution of ILP problems, such general approaches often have difficulty properly selecting the best specific relaxations and subproblem decompositions. With some insights into the problem at hand, insights that a general approach might not have, we can decompose the ILP problem into two subproblems. First, we use a partially relaxed version of the original, which is more easily solved. We can then use the solution from that problem to set fixed values for a subset of integer variables and resolve the original with that subset of integer variables acting as parameters. This relaxation-based technique is known as relax-and-fix-based decomposition (RFBD) [32]. While the solution is not guaranteed to be optimal in the RFBD technique, the proper selection of the integer variables to relax in the first subproblem and of the integer variables for which we can fix their values in the second subproblem can permit near-optimal solutions. As with most near-optimal algorithms, quality of the solution (in terms of both the objective function value and the runtime improvement) will depend on careful selection of those subsets of variables.

With the particular ILP problem we developed above, we felt that if we could use a partially relaxed version of the problem to first identify which specific span additions to select, then we could fix that topology and solve the original unrelaxed problem with a known topology. We therefore decompose our problem as follows:Step  1: relax working capacity (), spare capacity (), and -cycle placement variables () and solve the original ILP problem. In other words, all of the integrality requirements on those decision variables are removed and the ILP solved.Step  2: fix all span establishment variables () to the values obtained in Step 1. In other words, take the resulting values for all span establishment variables as solved in Step 1, and convert those variables to parameters with the same values.Step 3: solve the original ILP, resetting integrality requirements in all relevant variables (but where all variables are fixed to the values in Step  2).

The main rationale for the above decomposition approach is that the span establishment variables are binary, and so fractional values would have very little meaning; if , then the span is not selected, and if , then the span is selected, but , for instance, is difficult to interpret in a manner that has any real physical meaning. The three sets of variables noted in Step  1, however, can be permitted to take on fractional values, and the solution can still impart some physical meaning. For instance, would mean that 7.8 units of working capacity are placed on span , which might not strictly be feasible (one cannot place a fractional unit of capacity) but is still conceptually understandable. In addition, the span establishment variables will still be driven to or whether the , , and variables are integer or not. Then when we resolve the ILP in Step  3, with the span establishment variables fixed in Step  2, the resultant ILP is equivalent to the basic -cycle network design problem.

The branch-and-bound technique is widely used to solve ILP models, as there is no known polynomial time algorithm. This technique applies an intelligent enumeration scheme that can cover all possible solutions by only evaluating a small number of solutions [33]. However, in the worst-case situations, it requires complete enumeration, and in practice, the solver can require a very long time to reach optimality. For our model above, if the solver needed to enumerate all possible nodes in the branch-and-bound tree, the total number of nodes is , where , , and are number of integer working capacity variables, spare capacity variables, and -cycle variables. More specifically, , , and . However, in our proposed decomposition method, even in the worst-case scenarios, the total number of possible nodes in the branch-and-bound tree for Step  1 is only due to the relaxations of the integrality property of the first three variables. Furthermore, the resulting model in Step  2 becomes much easier to solve, as very tight LP relaxations arise due to the “known” values of the span establishment variables. As a result the proposed method reduces the overall computational complexity of the model significantly, which we’ll discuss in more detail in a moment.

6. Results for Decomposition Method

To test the performance of this above technique, we selected the most computationally complex instance of the problem for each network (though we skip the 10-node and 15-node networks, as their solutions are already trivial). More specifically, we tested the decomposition technique on the 20-node network with 18 eligible spans, the 25-node network with 20 eligible spans, the 30-node network with 26 eligible spans, the 35-node network with 24 eligible spans, and the 40-node network with 37 eligible spans. And as stated earlier, our ILP models were implemented in AMPL and solved with the CPLEX 11.2 solver. We used a CPLEX mipgap setting of 0.001, which means that all test cases solved to full termination are provably within 0.1% of optimality.

Figure 13 compares the CPU runtimes of the decomposition approach with the original ILP solution. The general trend is that runtime improvements are greater in larger test cases. As we can observe, we see only moderate runtime improvements for the midsize networks (a 21% reduction in the 20-node test case) but significantly greater runtime improvements in the largest networks (a 99.99% reduction in the 40-node test case).

546301.fig.0013
Figure 13: Comparison of CPU time between decomposition method and exact method.

Of course, the tradeoff when implementing a heuristic approach is often a reduction in optimality of the resulting solution, so we also need to compare the solutions we obtain with the decomposition approach with the solutions from Section 4. As we can see from Table 1, the solutions obtained with the decomposition technique are at worst only 0.016% more costly than the full ILP, and in three of the five cases the decomposition approach provides a less-costly solution than the full ILP. This is counterintuitive, as the cost of the full ILP solution should serve as the lower bound on the cost of solutions obtained via our heuristic approach. The explanation is that the differences are smaller than the mipgap setting of 0.1%. In fact, we can note that in all cases, the difference between the solutions obtained from the decomposition approach and the full ILP are within the optimality gap setting of 0.1%, which means that the two approaches effectively provide equivalent solutions.

tab1
Table 1: Comparison of normalized total cost between decomposition method and exact method.

7. Conclusion

We have developed a new ILP model for incremental topology optimization in a -cycle network that is capable of selecting an optimal subset of eligible spans to add to an existing -cycle network. While the ILP proves to be relatively easy to solve for small test case network instances, it is computationally complex to solve for larger networks. We then developed a relaxation-based decomposition heuristic that significantly reduces runtime of the ILP in large networks, while having no statistical impact on optimality. In the most computationally complex instance, the ILP runtime of over 184 thousand seconds (more than two days) was reduced to less than 2300 seconds (less than an hour), while the objective function value remained within the optimality gap. In fact, the heuristic solution was slightly better than the full ILP (though again, we note that it was not provably better since the difference was smaller than the optimality gap).

References

  1. W. Grover, Mesh-Based Survivable Networks, Prentice Hall, Upper Saddle River, NJ, USA, 2004.
  2. J. Doucette, Advances on design and analysis of mesh-restorable networks [Ph.D. thesis], University of Alberta, Edmonton, Canada, December 2004.
  3. D. Stamatelakis and W. D. Grover, “Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (“p-cycles”),” IEEE Transactions on Communications, vol. 48, no. 8, pp. 1262–1265, 2000. View at Scopus
  4. 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
  5. H. Huang and J. Copeland, “Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection,” in Proceedings of the IEEE Workshop on High Performance Switching and Routing, pp. 31–35, May 2001. View at Scopus
  6. H. Huang and J. A. Copeland, “A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience,” IEEE Communications Magazine, vol. 40, no. 11, pp. 46–51, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, and Y. Li, “Local and global hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Transactions on Communications, vol. 58, no. 3, pp. 851–859, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. 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
  9. A. Kodian and W. D. Grover, “Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optical-path protection,” IEEE Journal of Lightwave Technology, vol. 23, no. 10, pp. 3241–3259, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. D. P. Onguetou and W. D. Grover, “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), July 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. H. Sakauchi, Y. Okanoue, and S. Hasegawa, “Spare-channel design schemes for self-healing networks,” IEICE Transactions on Communications, vol. 75, no. 7, pp. 624–633, 1992.
  12. C. Wynants, Network Synthesis Problems, Combinatorial Optimization Series, Kluwer Academic Publishers, 2001.
  13. R. R. Iraschko, M. H. MacGregor, and W. D. Grover, “Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks,” IEEE/ACM Transactions on Networking, vol. 6, no. 3, pp. 325–336, 1998. View at Scopus
  14. J. Doucette and W. D. Grover, “Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1912–1923, 2000. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Doucette, D. He, W. D. Grover, and O. Yang, “Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design,” in Proceedings of the Design of Reliable Communication Networks (DRCN '03), pp. 212–220, Banff, Canada, October 2003.
  16. M. Herzberg and S. Bye, “An optimal spare-capacity assignment model for survivable networks with hop limits,” in IEEE Global Communications Conference (GlobeCom '94), pp. 1601–1607, San Francisco, Calif, USA, December 1994.
  17. W. D. Grover and J. Doucette, “Topological design of span-restorable mesh transport networks,” Annals of Operations Research, vol. 106, no. 1–4, pp. 79–125, 2001. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Kershenbaum, Telecommunications Network Design Algorithms, McGraw-Hill, New York, NY, USA, 1993.
  19. R. R. Boorstyn and H. Frank, “Large-scale network topological optimization,” IEEE Transactions on Communications, vol. 25, no. 1, pp. 29–47, 1977. View at Scopus
  20. A. Z. Kasem and J. Doucette, “Incremental optical network topology optimization using meta-mesh span restoration,” in Proceedings of the Design of Reliable Communication Networks (DRCN '11), Krakow, Poland, October 2011.
  21. H. Dirilten and R. W. Donaldson, “Topological design of distributed data communications networks using linear regression clustering,” IEEE Transactions on Communications, vol. 25, no. 10, pp. 1083–1092, 1977. View at Scopus
  22. R. S. Cahn, Wide Area Network Design: Concepts and Tools for Optimization, Morgan Kaufman Publishers, San Francisco, Calif, USA, 1998.
  23. D. A. Schupke, “An ILP for optimal p-cycle selection without cycle enumeration,” in Proceedings of the Optical Network Design and Modelling (ONDM '04), Ghent, Belgium, February 2004.
  24. H. Li, B. Jaumard, and X. Fu, “Scalable design of p-cycles for node protection without candidate pre-enumeration,” in Proceedings of the International Conference on Multimedia Technology (ICMT '10), October 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Rajagopalan, S. S. Heragu, and G. D. Taylor, “A Lagrangian relaxation approach to solving the integrated pick-up/drop-off point and AGV flowpath design problem,” Applied Mathematical Modelling, vol. 28, no. 8, pp. 735–750, 2004. View at Publisher · View at Google Scholar · View at Scopus
  26. 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. Part 3 (of 3), pp. 537–543, June 1998. View at Scopus
  27. R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Duxbury Press, 2002.
  28. ILOG, ILOG CPLEX 11.0 User’s Manual, ILOG, 2007.
  29. B. Gendron, T. G. Crainic, and A. Frangioni, “Multicommodity capacitated net-work design,” in Telecommunications Network Planning, B. Sanso and P. Soriano, Eds., pp. 1–19, Kluwer Academic Publishers, 1999.
  30. H.-J. Kim and J. N. Hooker, “Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach,” Annals of Operations Research, vol. 115, no. 1–4, pp. 95–124, 2002. View at Publisher · View at Google Scholar · View at Scopus
  31. L. A. Wolsey, Integer Programming, Wiley-Interscience, Toronto, Canada, 1998.
  32. M. Noor-E-Alam and J. Doucette, “Relax-and-fix decomposition technique for solving large scale grid-based location problems,” Computers & Industrial Engineering, vol. 63, no. 4, pp. 1062–1073, 2012.
  33. D.-S. Chen, R. G. Baton, and Y. Dang, Applied Integer Programming, chapter 2, John Willey & Sons, 2010.