Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost

  • 173 Accesses

  • 7 Citations


Ensuring network survivability is of the utmost importance in today’s networks. A Shared Risk Link Group (SRLG) is the set of links in the network that share a common physical resource subject to fault(s). This concept allows an upper layer the ability to implement SRLG diverse routing.

Two algorithms, the Conflicting SRLG Exclusion (CoSE) and the Iterative Modified Suurballe’s Heuristic (IMSH), will be shortly reviewed. The first solves the min-min problem and the second the min-sum problem, considering SRLG-disjoint paths. It will then be described a new version of CoSE, which will be designated as CoSE-MS, for solving the min-sum problem for SRLG diverse routing. Finally CoSE-MS and IMSH performance will be compared using random networks and an optical network. Results show that CoSE-MS is a good compromise between the quality of obtained solutions and the used CPU time.

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


  1. 1.

    Bang-Jensen, J., & Gutin, G. (2002). Springer monographs in mathematics. Digraphs: Theory, Algorithms and Applications. London: Springer.

  2. 2.

    Betker, A., Gerlach, C., Jäger, M., Barry, M., Bodamer, S., Späth, J., Gauger, C. M., & Köhn, M. (2003). Reference transport network scenario (Technical report). MultiTeraNet Report.

  3. 3.

    Bhandari, R. (1999). Survivable networks, algorithms for diverse routing. Norwell: Kluwer Academic.

  4. 4.

    Clímaco, J., & Pascoal, M. M. B. (2009). Finding non-dominated bicriteria shortest pairs of disjoint simple paths. Computers & Operations Research, 36(11), 2892–2898.

  5. 5.

    Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.

  6. 6.

    Eppstein, D. (1999). Finding the k shortest paths. SIAM Journal on Computing, 28(2), 652–673.

  7. 7.

    Gomes, T., & Craveirinha, J. (2010). An algorithm for enumerating SRLG diverse path pairs. Journal of Telecommunications and Information Technology, 3, 5–12.

  8. 8.

    Gomes, T., & Fernandes, L. (2010). Obtaining a SRLG-disjoint path pair of min-sum cost. In J. Rak, D. Tipper, & K. Walkowiak (Eds.), RNDM’10—2nd international workshop on reliable networks designand modeling (pp. 116–122). Moscow. ISBN: 978-I-4244-7283-3

  9. 9.

    Gouveia, L., Patrício, P., & Sousa, A. (2008). Hop-constrained node survivable network design: An application to MPLS over WDM. Networks and Spatial Economics, 8(1), 3–21.

  10. 10.

    Ho, P.-H., & Mouftah, H. T. (2004). Shared protection in mesh WDM networks. IEEE Communications Magazine, 42(1), 70–76.

  11. 11.

    Hu, J. Q. (2003). Diverse routing in optical mesh networks. IEEE Transactions on Communications, 51(3), 489–494.

  12. 12.

    Kompella, K., & Rekhter, Y. (2005). OSPF extensions in support of generalized multi-protocol label switching (GMPLS) (IETF RFC 4203).

  13. 13.

    Laborczi, P., Tapolcai, J., Ho, P.-H., Cinkler, T., Recski, A., & Mouftah, H. T. (2001). Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In T. Cinkler (Ed.), Proceedings of design of reliable communication networks (DCRN 2001) (pp. 220–227), Hungary.

  14. 14.

    Martins, E., & Pascoal, M. (2003). A new implementation of Yen’s ranking loopless paths algorithm. 4OR, 1(2), 121–134.

  15. 15.

    Martins, E., Pascoal, M., & Santos, J. (1999). An algorithm for ranking loopless paths (Technical Report 99/007). CISUC.

  16. 16.

    Martins, E., Pascoal, M., & Santos, J. (1999). Deviation algorithms for ranking shortest paths. International Journal of Foundations of Computer Science, 10(3), 247–263.

  17. 17.

    Pan, P., Swallow, G., & Atlas, A. (2005). Fast reroute extensions to RSVP-TE for LSP tunnels (IETF RFC 4090).

  18. 18.

    Pan, X., & Xiao, G. (2004). Algorithms for the diverse routing problem in WDM networks with shared risk link groups. In International Conference on Computational Science (ICCS 2004) (pp. 381–385), Krakow, Poland.

  19. 19.

    Pan, X., & Xiao, G. (2006). Heuristics for diverse routing in wavelength-routed networks with shared risk link groups. Photonic Network Communications, 11(1), 29–38.

  20. 20.

    Rostami, M. J., Khorsandi, S., & Khodaparast, A. A. (2007). CoSE: A SRLG-disjoint routing algorithm. In Proceedings of the fourth European conference on universal multiservice networks (ECUMN’07), Toulouse, France.

  21. 21.

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

  22. 22.

    Todimala, A., & Ramamurthy, B. (2004). IMSH: An iterative heuristic for SRLG diverse routing in WDM mesh networks. In 13th international conference on computer communications and networks, ICCCN’2004 (pp. 199–204).

  23. 23.

    Todimala, A., & Ramamurthy, B. (2005). A heuristic with bounded guarantee to compute diverse paths under shared protection in WDM mesh networks. In IEEE Globlecom 2005 (pp. 1915–1919), November 28–December 2, 2005, St. Louis, MO, USA.

  24. 24.

    Xu, D., Xiong, Y., Qiao, C., & Li, G. (2003). Trap avoidance and protection schemes in networks with shared risk link groups. Journal of Lightwave Technology, 21(11), 2683–2693.

  25. 25.

    Xu, D., Chen, Y., Xiong, Y., Qiao, C., & He, X. (2004). On finding disjoint paths in single and dual link cost networks. In IEEE INFOCOM 2004, Hong Kong.

  26. 26.

    Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11), 712–716.

Download references

Author information

Correspondence to Teresa Gomes.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Gomes, T., Simões, C. & Fernandes, L. Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun Syst 52, 737–749 (2013). https://doi.org/10.1007/s11235-011-9574-5

Download citation


  • Routing
  • SRLG-disjoint
  • Paths with minimal cost sum
  • Optical networks