Advertisement

Photonic Network Communications

, Volume 31, Issue 1, pp 11–22 | Cite as

Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach

  • Teresa Gomes
  • Luísa Jorge
  • Paulo Melo
  • Rita Girão-Silva
Article
  • 142 Downloads

Abstract

Path protection is a fast and capacity-efficient approach for increasing the availability of end-to-end connections. However, sometimes it is not possible to obtain a fully disjoint path pair. In this case, it may be admissible to consider a path pair which is as disjoint as possible, and thus provide the best (in a certain sense) level of the single-fault protection that can be ensured using this type of approach. A shared risk link group (SRLG) is a group of links which have a common risk of failure. Two new heuristics for solving the min-sum maximally node and SRLG-disjoint path pair are presented. The relative performance of the new heuristics and also of two other previously proposed heuristics is evaluated using four different networks. Results, regarding accuracy and execution time of the studied heuristics, show that one of the new proposed algorithms can be a good compromise for use in the Generalized Multi-protocol Label Switching control plane.

Keywords

Min-sum SRLG maximally disjoint Multi-objective 

Notes

Acknowledgments

We thank Sérgio Mendes for implementing part of the code used in this work. The authors acknowledge financial support through project QREN 23301 PANORAMA II, co-financed by European Union’s FEDER through “Programa Operacional Factores de Competitividade” (POFC) of QREN (FCOMP-01-0202-FEDER-023301), by the Portuguese Foundation for Science and Technology under project grant UID/MULTI/00308/2013 and by PT Inovação R&D Project “End to End Protection considering SRLGs-II”.

References

  1. 1.
    IBM ILOG CPLEX Optimization Studio V12.5. IBM (2012)Google Scholar
  2. 2.
    Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: extensions to RSVP for LSP tunnels. IETF RFC 3209 (2001)Google Scholar
  3. 3.
    Bhandari, R.: Survivable Networks, Algorithms for Diverse Routing. Kluwer Academic Publishers, Norwell, Massachusetts (1999)Google Scholar
  4. 4.
    Cheng, X., Shao, X., Wang, Y.: Multiple link failure recovery in survivable optical networks. Photonic Netw. Commun. 14, 159–164 (2007)CrossRefGoogle Scholar
  5. 5.
    Farrel, A., Vasseur, J.P., Ash, J.: A path computation element (PCE)-based architecture. ITEF RFC 4655 (2006)Google Scholar
  6. 6.
    Gao, C., Zhu, Y., Jue, J.: SRLG-aware topology aggregation for survivable multi-domain optical networks. In: 2011 IEEE International Conference on Communications (ICC), pp. 1–5 (2011). doi: 10.1109/icc.2011.5963224
  7. 7.
    Gomes, T., Fernandes, L.: Obtaining a SRLG-disjoint path pair of min-sum cost. In: Rak, J., Tipper, D., Walkowiak, K. (eds.) RNDM 2010–2nd International Workshop on Reliable Networks Design and Modeling, Colocated with ICUMT 2010, pp. 116–122. ISBN: 978-I-4244-7283-3. Moscow (2010)Google Scholar
  8. 8.
    Gomes, T., Jorge, L., Melo, P., Girão-Silva, R., Mendes, S.: Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks. In: 9th International Conference on Design of Reliable Communication Networks—DRCN 2013, pp. 314–321. Budapest, Hungary (2013)Google Scholar
  9. 9.
    Gomes, T., Simões, C., Fernandes, L.: Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun. Syst. J., 1–13 (2011). doi: 10.1007/s11235-011-9574-5
  10. 10.
    Hu, J.Q.: Diverse routing in optical mesh networks. IEEE Trans. Commun. 51(3), 489–494 (2003)CrossRefGoogle Scholar
  11. 11.
    Luo, H., Li, L., Yu, H.: Insights for segment protection in survivable WDM mesh networks with SRLG constraints. Photonic Netw. Commun. 14, 361–368 (2007)CrossRefGoogle Scholar
  12. 12.
    Mannie, E.: Generalized multi-protocol label switching (GMPLS) architecture, IETF RFC 3945 (2004)Google Scholar
  13. 13.
    Marler, R., Arora, J.: Survey of multi-objective optimization methods for engineering. Struct. Multidiscip. Optim. 26(6), 369–395 (2004). doi: 10.1007/s00158-003-0368-6 MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Mendonça, J., Naser, H.: Class of service with partial protection in multilayered networks with SRLG constraints. In: Proceedings of the IEEE Symposium on Computers and Communications (ISCC’10), pp. 279–284. Riccione, Italy (2010)Google Scholar
  15. 15.
    Oki, E., Matsuura, N., Shiomoto, K., Yamanaka, N.: A disjoint path selection scheme with shared risk link groups in GMPLS networks. IEEE Commun. Lett. 6(9), 406–408 (2002)CrossRefGoogle Scholar
  16. 16.
    Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0-survivable network design library. Networks 55(3), 276–286 (2010). doi: 10.1002/net.20371 Google Scholar
  17. 17.
    Palmieri, F.: GMPLS control plane services in the next-generation optical Internet. Internet Protoc. J. 11(3), 2–18 (2008)Google Scholar
  18. 18.
    Pan, X., Xiao, G.: Heuristics for diverse routing in wavelength-routed networks with shared risk link groups. Photonic Netw. Commun. 11, 29–38 (2006)CrossRefGoogle Scholar
  19. 19.
    Rostami, M.J., Khorsandi, S., Khodaparast, A.A.: CoSE: A SRLG-disjoint routing algorithm. In: Proceedings of the Fourth European Conference on Universal Multiservice Networks (ECUMN’07). Toulouse, France (2007)Google Scholar
  20. 20.
    Rostami, M.J., Zarandi, A.A.E., Hoseininasab, S.M.: MSDP with ACO: a maximal SRLG disjoint routing algorithm based on ant colony optimization. J. Netw. Comput. Appl. 35, 394–402 (2012)Google Scholar
  21. 21.
    Shao, X., Xiao, G., Zhou, L., Cheng, X., Wang, Y.: Hybrid protection in WDM networks with shared risk link groups. Photonic Netw. Commun. 12, 295–307 (2006)CrossRefGoogle Scholar
  22. 22.
    Sheela, D., Chellamuthu, C.: A cost effective approach for WDM network protection under critical duct constraints. WSEAS Trans. Commun. 11(3), 103–112 (2012)Google Scholar
  23. 23.
    Silva, J., Gomes, T.M., Fernandes, L., Simões, C., Craveirinha, J.: An heuristic for maximally SRLG-disjoint path pairs calculation. In: 3rd International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT 2011 Budapest). Budapest, Hungary (2011)Google Scholar
  24. 24.
    Todimala, A., Ramamurthy, B.: 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 (2004). doi: 10.1109/ICCCN.2004.1401627
  25. 25.
    Wang, S., Li, L.: Impairment aware optimal diverse routing for survivable optical networks. Photonic Netw. Commun. 13, 139–154 (2007)CrossRefGoogle Scholar
  26. 26.
    Xu, D., Li, G., Ramamurthy, B., Chiu, A., Wang, D., Doverspike, R.: On provisioning diverse circuits in heterogeneous multi-layer optical networks. Comput. Commun. 36(6), 689–697 (2013). doi: 10.1016/j.comcom.2012.08.014. Reliable Network-based ServicesCrossRefGoogle Scholar
  27. 27.
    Xu, D., Xiong, Y., Qiao, C.: Novel algorithms for shared segment protection. IEEE J. Sel. Areas Commun. 21(8), 1320–1331 (2003)CrossRefGoogle Scholar
  28. 28.
    Xu, D., Xiong, Y., Qiao, C., Li, G.: Trap avoidance and protection schemes in networks with shared risk link groups. J. Lightw. Technol. 21(11), 2683–2693 (2003)CrossRefGoogle Scholar
  29. 29.
    Yan, W., Junhui, Z., Jiazhi, Z.: New SRLG-diverse path selection algorithm in survivable GMPLS networks. J. Syst. Eng. Electron. 20(2), 412–419 (2009)Google Scholar
  30. 30.
    Zhang, F., Li, D., de Dios, O.G., Margaria, C.: RSVP-TE extensions for collecting SRLG information. IETF Draft (2014)Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Teresa Gomes
    • 1
    • 2
  • Luísa Jorge
    • 2
    • 3
  • Paulo Melo
    • 2
    • 4
  • Rita Girão-Silva
    • 1
    • 2
  1. 1.Department of Electrical and Computer EngineeringUniversity of CoimbraCoimbraPortugal
  2. 2.INESC CoimbraCoimbraPortugal
  3. 3.Polytechnic Institute of BragançaBragançaPortugal
  4. 4.Faculty of EconomicsUniversity of CoimbraCoimbraPortugal

Personalised recommendations