Skip to main content
SpringerLink
Log in

Robust FIPP p-cycles against dual link failures

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We propose a new generic flow formulation for Failure-Independent Path-Protecting (FIPP) p-cycles subject to multiple failures. While our new model resembles the decomposition model formulation proposed by Orlowski and Pioro (Networks, 2011) in the case of classical shared path protection, its originality lies in its adaptation to FIPP p-cycles. When adapted to that last pre-configured pre-cross connected protection scheme, the bandwidth sharing constraints must be handled in a different way in order to take care of the sharing along the FIPP p-cycles. It follows that, instead of a polynomial-time solvable pricing problem as in the model of Orlowski and Pioro (Networks, 2011), we end up with a much more complex pricing problem, which has an exponential number of constraints due to some subtour elimination constraints. Consequently, in order to efficiently solve the pricing problem, we consider: (i) a hierarchical decomposition of the original pricing problem; (ii) heuristics in order to go around the large number of constraints in the pricing problem.

Performance evaluation is made in the case of FIPP p-cycles subject to dual failures. For small to medium size networks, the proposed model remains fairly scalable for increasing percentages of dual failures, and requires much less bandwidth than p-cycle protection schemes (ratio varies from 2 to 4). For larger networks, heuristics are required in order to keep computing times reasonable. In the particular case of single link failures, it compares very favorably (5 to 10 % of bandwidth saving) to the previously proposed column generation ILP model of Rocha, Jaumard and Stidsen (Telecommun. Syst., 2012).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Applegate, D., Bixby, R., Chvátal, V., & Cook, W. (2007). The traveling salesman problem: a computational study. Princeton: Princeton University Press.

    Google Scholar 

  2. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., & Vance, P. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46(3), 316–329.

    Article  Google Scholar 

  3. Choi, H., Subramaniam, S., & Choi, H. (2002). On double-link failure recovery in WDM optical networks. In IEEE annual joint conference of the IEEE computer and communications societies—INFOCOM (Vol. 2).

    Google Scholar 

  4. Chvatal, V. (1983). Linear programming. New York: Freeman.

    Google Scholar 

  5. Clouqueur, M., & Grover, W. (2005). Mesh-restorable networks with enhanced dual-failure restorability properties. Photonic Network Communications, 9(1), 7–18.

    Article  Google Scholar 

  6. Eiger, M., Luss, H., & Shallcross, D. (2011). Optical path restoration for up to two failures using preconfigured cycles. Telecommunication Systems.

  7. Grover, W. D., & Stamatelakis, D. (1998). Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In IEEE international conference on communications—ICC (pp. 537–543).

    Google Scholar 

  8. Huang, C., Li, M., & Srinivasan, A. (2007). A scalable path protection mechanism for guaranteed network reliability under multiple failures. IEEE Transactions on Reliability, 56, 254–267.

    Article  Google Scholar 

  9. IBM: IBM ILOG CPLEX 12.0 Optimization Studio (2011).

  10. Jaumard, B., Rocha, C., Baloukov, D., & Grover, W. D. (2007). A column generation approach for design of networks using path-protecting p-cycles. In Proceedings of IEEE/VDE workshop on Design of Reliable Communication Networks—DRCN.

    Google Scholar 

  11. Kodian, A., & Grover, W. (2005). Failure-independent path-protecting p-cycles efficient and simple fully preconnected optical-path protection. Journal of Lightwave Technology, 23(10), 3241–3259.

    Article  Google Scholar 

  12. Kodian, A., Grover, W., & Doucette, J. (2005). A disjoint route sets approach to design of failure-independent path-protection p-cycle networks. In Proceedings of IEEE/VDE workshop on Design of Reliable Communication Networks—DRCN. 8 pp.

    Google Scholar 

  13. Liu, C., & Ruan, L. (2006). p-Cycle design in survivable WDM networks with shared risk link groups (SRLGs). Photonic Network Communications, 11(3), 301–311.

    Article  Google Scholar 

  14. Orlowski, S., & Pióro, M. (2011). On the complexity of column generation in survivable network design with path-based survivability mechanisms. Networks. doi:10.1002/net.20484

    Google Scholar 

  15. Orlowski, S., Pióro, M., Tomaszewski, A., & Wessäly, R. (2007). SNDlib 1.0–Survivable Network Design Library. In Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium.

    Google Scholar 

  16. Ramasubramanian, S., & Chandak, A. (2008). Dual-link failure resiliency through backup link mutual exclusion. IEEE/ACM Transactions on Networking, 16(1), 539–548.

    Google Scholar 

  17. Rocha, C. (2009). Optimization of p-cycle protection schemes in optical networks. Ph.D. thesis, DIRO, Université de Montréal.

  18. Rocha, C., Jaumard, B., & Stidsen, T. (2012, to appear). Efficient computation of FIPP p-cycles. Telecommunication Systems.

  19. Schupke, D., Grover, W., & Clouqueur, M. (2004). Strategies for enhanced dual failure restorability with static or reconfigurable p-cycle networks. In IEEE International Conference on Communications—ICC (Vol. 3, pp. 1628–1633).

    Google Scholar 

  20. Sebbah, S., & Jaumard, B. (2009). A global approach to fully pre-cross connected protection schemes design using p-structures. In IEEE RNDM, St Petersburg, Russia.

    Google Scholar 

  21. Sebbah, S., & Jaumard, B. (2009). Dual failure recovery in WDM networks based on p-cycles. In International conference on Optical Networking Design and Modeling—ONDM, Braunschweig, Germany.

    Google Scholar 

  22. Shen, L., Yang, X., & Ramamurthy, B. (2005). Shared risk link group (srlg)-diverse path provisioning under hybrid service level agreements in wavelength-routed optical mesh networks. IEEE/ACM Transactions on Networking, 13, 918–931.

    Article  Google Scholar 

Download references

Acknowledgements

The first author has been supported by a Concordia University Research Chair (Tier I) and by an NSERC (Natural Sciences and Engineering Research Council of Canada) grant.

Author information

Authors and Affiliations

  1. CSE, Concordia University, Montreal, QC, Canada

    Brigitte Jaumard & Hai Anh Hoang

  2. DIRO, Université de Montréal, Montreal, QC, Canada

    Do Trung Kien

Authors
  1. Brigitte Jaumard
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hai Anh Hoang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Do Trung Kien
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brigitte Jaumard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaumard, B., Hoang, H.A. & Kien, D.T. Robust FIPP p-cycles against dual link failures. Telecommun Syst 56, 157–168 (2014). https://doi.org/10.1007/s11235-013-9825-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-013-9825-8

Keywords

Search

Navigation