Skip to main content
SpringerLink
Log in

Heuristic methods for single link shared backup path protection

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Protecting communication networks against failures is becoming increasingly important as they have become an integrated part of our society. Cable failures are fairly common, but it is unacceptable for a single cable failure to disconnect communication for more than a few seconds—hence protection schemes are employed. In contrast to manual intervention, automatic protection schemes such as shared backup path protection (SBPP) can recover from failure quickly and efficiently. SBPP is a simple but efficient protection scheme that can be implemented in backbone networks with technology available today. In SBPP backup paths are planned in advance for every failure scenario in order to recover from failures quickly and efficiently. Planning SBPP is an NP-hard optimization problem, and previous work confirms that it is time-consuming to solve the problem in practice using exact methods. We present heuristic algorithms and lower bound methods for the SBPP planning problem. Experimental results show that the heuristic algorithms are able to find good quality solutions in minutes. A solution gap of less than \(3.5~\%\) was achieved for 5 of 7 benchmark instances (and a gap of less than \(11~\%\) for the remaining instances.)

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

Similar content being viewed by others

References

  • Bhandari, R.: Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic, Norwell (1998)

    Google Scholar 

  • Dahl, G., Stoer, M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10, 1–11 (1998)

    Article  MathSciNet  Google Scholar 

  • Følsgaard, C., Spælling, A.: Sikring af kommunikationsnetværk ved brug af single backup path protection. Bachelor of Engineering Thesis, Technical University of Denmark (DTU) (2007)

  • Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  • Grover, W.D.: Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS. SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River (2003)

    Google Scholar 

  • Guo, Q., Ho, P.-H., Fu, H.-Y., Janos, T., Mouftah, H.T.: Spare capacity reprovisioning for high availability shared backup path protection connections. Comput. Commun. 33(5), 603–611 (2010)

    Article  Google Scholar 

  • Haahr, J.T.: Heuristic methods for the shared backup path protection problem. Master thesis, University of Copenhagen, Copenhagen (2010)

  • Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol. 53. Elsevier Science, Amsterdam (1992)

  • Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

  • Laborczi, P., Tapolcai, J., Ho, P.H., Cinkler, T., Recski, A., Mouftah, H.T.: Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Proceedings of the International Workshop on Design Of Reliable Communication Networks (DRCN), pp. 220–227 (2001)

  • Li, C.L., Thomas, M.S., David, S.L.: Finding disjoint paths with different path-costs: complexity and algorithms. Networks 22(7), 653–667 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  • Li, G., Wang, D., Kalmanek, C., Doverspike, R.: Efficient distributed path selection for shared restoration connections. IEEE INFOCOM 2002(1), 140–149 (2002)

    Google Scholar 

  • Li, G., Wang, D., Kalmanek, C., Doverspike, R.: Efficient distributed restoration path selection for shared mesh restoration. IEEE/ACM Trans. Netw. 11(5), 761–771 (2003)

    Article  Google Scholar 

  • Liu, Y.: Spare capacity allocation: model, analysis and algorithm. Phd thesis, University of Pittsburgh, Pittsburgh (2001)

  • Liu, Y., Tipper, D., Siripongwutikorn, P.: Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Trans. Netw. 13(1), 198–211 (2005)

    Article  Google Scholar 

  • Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0-Survivable network design library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, April 2007. http://sndlib.zib.de, extended version accepted in Networks (2009)

  • Orlowski, S., Pióro, M.: Complexity of column generation in network design with path-based survivability mechanisms. Networks 59(1), 132–147 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  • Ou, C., Zhang, J., Zang, H.,Sahasrabuddhe, L.H., Mukherjee, B.: Near-optimal approaches for shared-path protection. In: ICC ’03. IEEE International Conference on Communications, pp. 1320–1324 (2003)

  • Ou, C., Jing, Z., Hui, Z., Sahasrabuddhe, L.H., Biswanath, M.: New and improved approaches for shared-path protection in wdm mesh networks. J. Lightwave Technol. 22, 1223–1232 (2004)

    Article  Google Scholar 

  • Phung, Q.V., Nguyen, H.N., Habibi, D., Lo, K.: A shared backup path protection scheme for optical mesh networks. In: 2005 Asia-Pacific Conference on Communications (2005)

  • Pióro, M., Śliwiński, T., Zagożdżon, M., Dzida, M., Ogryczak, W.: Path generation issues for survivable network design. Computational Science and Its Applications—ICCSA 2008, vol 5073, pp. 820–835. Springer, Berlin/Heidelberg (2008)

  • Pisinger, D., Røpke, S.: Large neighbourhood search. In: Handbook of Metaheuristics, chapt. 13, 2nd edn., pp. 399–420. Springer, New York (2010)

  • Qiao, C., Dahai, X.: Distributed partial information management (DPIM) schemes for survivable networks: Part I. IEEE INFOCOM 2002, 1 (2002)

    Google Scholar 

  • Reeves, C.R. (ed.): Modern Heuristic Techniques for Combinatorial Problems. Wiley, New York (1993)

    MATH  Google Scholar 

  • Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming—CP98, vol. 1520, pp. 417–431. Springer, Berlin/Heidelberg (1998)

  • Stidsen, T., Petersen, B., Spoorendonk, S., Zachariasen, M., Rasmussen, K.B.: Optimal routing with failure-independent path protection. Networks 55(2), 125–137 (2010)

    MATH  MathSciNet  Google Scholar 

  • Stoer, M., Dahl, G.: A polyhedral approach to multicommodity survivable network design. Numerische Mathematik 68, 149–167 (1993)

    Article  MathSciNet  Google Scholar 

  • Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325–336 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  • Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)

    Google Scholar 

  • Xiong, Y., Mason, L.G.: Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Trans. Netw. 7(1), 98–110 (1999)

    Article  Google Scholar 

  • Xiong, Y., Dahai, X.: Achieving fast and bandwidth-efficient shared-path protection. J. Lightwave Technol. 21(2), 365 (2003)

    Article  Google Scholar 

  • Xu, D., Yang, C., Yizhi, X., Chunming, Q., Xin, H.: On finding disjoint paths in single and dual link cost networks, vol. 1. In: IEEE INFOCOM (2004)

  • Xu, D., Chunming, Q., Yizhi, X.: An ultra-fast shared path protection scheme—distributed partial information management, Part II. IEEE International Conference on Network Protocols 344 (2002)

  • Żotkiewicz, M., Pióro, M., Tomaszewski, A.: Complexity of resilient network optimisation. Eur. Trans. Telecommun. 20(7), 701–709 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Copenhagen, 2100 , Copenhagen, Denmark

    Jørgen Thorlund Haahr & Martin Zachariasen

  2. DTU Management Engineering, Technical University of Denmark, 2800 Kgs. , Lyngby, Denmark

    Thomas Stidsen

Authors
  1. Jørgen Thorlund Haahr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Stidsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Zachariasen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jørgen Thorlund Haahr.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Haahr, J.T., Stidsen, T. & Zachariasen, M. Heuristic methods for single link shared backup path protection. J Heuristics 20, 539–560 (2014). https://doi.org/10.1007/s10732-014-9248-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-014-9248-z

Keywords

Search

Navigation