Skip to main content

Advertisement

Springer Nature Link
Log in

Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The survivable mapping problem in an IP-over-WDM network with a logical graph and physical graph is the problem of finding a mapping of a logical network in a physical layer so that any failure in physical topology does not break the logical topology’s connection. Determining whether a survivable mapping against failure exists is an NP-complete problem, and therefore many heuristic algorithms have been proposed in the literature. In this paper, a heuristic mapping design strategy is proposed to enable the lightpaths to more efficiently endure a node failure. We individually consider the logical topology by building a Hamiltonian cycle and then deal with the mapping problem for disjoint physical paths. Experimental results demonstrate that the proposed algorithm can provide efficient survivable mapping in IP-over-WDM networks. The simulation shows that the survivability of previous methods (SNF and SMART-Node) is around 60–80%, but our proposed algorithm can build survivable mapping in all kinds of situations.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Data availability

The data that support the findings of this study are available on request from the corresponding author. The data are not public available due to privacy or ethical restrictions.

References

  1. Yankov MP, de Moura UC, Da Ros F (2021) Power evolution modeling and optimization of fiber optic communication systems with EDFA repeaters. J Lightw Technol 39(10):3154–3161

    Article  Google Scholar 

  2. Calinescu G, Frieder O, Wan PJ (2002) Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE J Sel Areas Commun 20(1):183–189

    Article  Google Scholar 

  3. Wei JY (2002) Advances in the management and control of optical internet. IEEE J Sel Areas Commun 20(4):768–785

    Article  Google Scholar 

  4. Ren J, Li X (2022) Wireless network virtualization resource sharing based on dynamic resource allocation algorithm. Wirel Commun Mob Comput. https://doi.org/10.1155/2022/5654188

    Article  Google Scholar 

  5. Shahriar N, Boutaba R (2021) Survivable virtual network embedding. In: 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM), pp 748–753

  6. Viadana E, Ayoub O, Musumeci F, Tornatore M (2021) Survivable virtual network mapping against double-link failures based on virtual network capacity sharing. In: 2021 17th International Conference on Network and Service management (CNSM), pp 35–41

  7. Wang Y, Hu Q (2021) A path growing approach to optical virtual network embedding in slice networks. J Lightw Technol 39(8):2253–2262

    Article  Google Scholar 

  8. Shahriar N, Ahmed R, Chowdhury SR, Khan MMA, Boutaba R, Mitra J, Zeng F (2019) Virtual network embedding with guaranteed connectivity under multiple substrate link failures. IEEE Trans Commun 68(2):1025–1043

    Article  Google Scholar 

  9. Armitage J, Crochat O, Le Boudec JY (1997) Design of a Survivable WDM Photonic Network. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), vol 1, pp 244–252

  10. Nleya B, Nyakwende E (2008) Survivability: wavelength recovery for node and link failure in all optical networks. In: Proceedings of IEEE Third International Conference on Broadband Communications, Information Technology and Biomedical Applications, pp 492–498

  11. Modiano E, Narula-Tam A (2002) Survivable lightpath routing: a new approach to the design of WDM-based networks. IEEE J Sel Areas Commun 20(4):800–809

    Article  Google Scholar 

  12. Zhang L, Zhang N (2011) Survivable virtual topology design for single node failure. In: Proceedings of Third International Conference on Computer Research and Development (ICCRD), vol 2, pp 465–467

  13. Radics N, Bajzik L, Lakatos Z (2015) Survivable mapping of virtual topologies for double-node failure. IEEE/ACM Trans Netw 23(6):1903–1916

    Article  Google Scholar 

  14. Kurant M, Thiran P (2004) Survivable mapping algorithm by ring trimming (SMART) for large IP-over-WDM networks. In: Proceedings of the First International Conference on Broadband Networks, pp 44–53

  15. Kurant M, Thiran P (2007) Survivable routing of mesh topologies in IP-over-WDM networks by recursive graph contraction. IEEE J Sel Areas Commun 25(5):922–933

    Article  Google Scholar 

  16. Thulasiraman K, Javed MS, Xue G (2009) Circuits/cutsets duality and a unified algorithmic framework for survivable logical topology design in IP-over-WDM optical networks. In: Proceedings of IEEE International Conference on Computer Communications (INFOCOM), pp 1026–1034

  17. Crochat O, Boudec J, Gerstel O (2000) Protection interoperability for WDM optical networks. IEEE/ACM Trans Netw 8(3):384–395

    Article  MATH  Google Scholar 

  18. Fumagalli A, Valcarenghi L (2000) IP restoration vs. WDM protection: Is there an optimal choice? IEEE Netw 14(6):34–41

    Article  Google Scholar 

  19. Ramamuthy S, Mukherjee B (1999) Survivable WDM mesh networks: part I-protection. in: Proceedings of the Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol 2, pp 744–751

  20. Ramamuthy S, Mukherjee B (1999) Survivable WDM mesh networks: part II-restoration. In: IEEE International Conference on Communications, vol 3, pp 2023–2030

  21. Deng Q, Sasaki G, Su CF (2002) Survivable IP over WDM: an efficient mathematical programming problem formulation. In: Proceedings of the Allerton Conference on Communication, Control and Computing, vol 40, pp 518-527

  22. Ducatelle F, Gambardella LM (2004) FastSurv: a new efficient local search algorithm for survivable routing in WDM Networks. In: IEEE Global Telecommunications Conference, vol 3, pp 1925–1929

  23. Liu C, Ruan L (2007) A new survivable mapping problem in IP-over-WDM networks. IEEE J Sel Areas Commun 25(3):25–34

    Article  Google Scholar 

  24. Thulasiraman K, Lin T, Javed M, Xue G (2010) Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical networks. Opt Switch Netw 7(4):206–214

    Article  Google Scholar 

  25. Thulasiraman K, Javed M, Xue G (2010) Primal meets dual: a generalized theory of logical topology survivability in IP-over-WDM optical networks. In: Proceedings of the Second International Conference on Communication Systems and Networks, pp 1–10

  26. Thulasiraman K, Lin T, Zhou Z, Sahni S, Xue G (2014) Unified mathematical programming frameworks for survivable logical topology routing in IP-over-WDM optical networks. IEEE/OSA J Opt Commun Netw 6(2):190–203

    Article  Google Scholar 

  27. Sen A, Hao B, Shen BH (2002) Survivable routing in WDM networks. In: Proceedings of the Seventh International Symposium on Computers and Communications, pp 726–731

  28. Shahriar N, Taeb S, Chowdhury SR, Zulfiqar M, Tornatore M, Boutaba R, Hemmati M (2020) Reliable slicing of 5g transport networks with bandwidth squeezing and multi-path provisioning. IEEE Trans Netw Serv Manag 17(3):1418–1431

    Article  Google Scholar 

  29. Taeb S, Shahriar N, Chowdhury SR, Tornatore M, Boutaba R, Mitra J, Hemmati M (2019) Virtual network embedding with path-based latency guarantees in elastic optical networks. In: IEEE 27th International Conference on Network Protocols, pp 1–12

  30. Khorsandi BM, Tonini F, Amato E, Raffaelli C (2019) Dedicated path protection for reliable network slice embedding based on functional splitting. In: 21st International Conference on Transparent Optical Networks, pp 1-4

  31. Kishi Y, Kitsuwan N, Ito H, Chatterjee BC, Oki E (2019) Modulation-adaptive link-disjoint path selection model for 1+ 1 protected elastic optical networks. IEEE Access 7:25422–25437

    Article  Google Scholar 

  32. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Dijkstra’s algorithm. Introduction to algorithms. Section 24(3), pp 595–601

  33. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Johnson’s algorithm for sparse graphs. Introduction to algorithms. Section 25(3), pp 636–640

  34. Gross JL, Yellen J, Anderson M (2018) Graph theory and its applications. Chapman and Hall/CRC

    Book  MATH  Google Scholar 

  35. Roberts FS (1978) Graph theory and its applications to problems of society. Society for industrial and applied mathematics

    Book  MATH  Google Scholar 

  36. Thulasiraman K, Swamy MNS (2011) Graphs: theory and algorithms. Wiley

    MATH  Google Scholar 

  37. West D (1996) Introduction to graph theory. Prentice Hall

  38. Dharwadker A (2004) A new algorithm for finding Hamiltonian circuits. In: Proceedings of the Institute of Mathematics, Amazon Books

  39. Bhandari R (1999) Suurballe’s disjoint pair algorithms. Algorithms for diverse routing, survivable networks, pp 86–91

  40. Perl Y, Shiloach Y (1978) Finding two disjoint paths between two pairs of vertices in a graph. J ACM 25(1):1–9

    Article  MathSciNet  MATH  Google Scholar 

  41. SNDlib (2022) Last access date: Jan 2022, http://sndlib.zib.de/home.action

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Yunlin University of Science and Technology, 123 University Road, Yunlin, 64002, Taiwan

    Dun-Wei Cheng

  2. Department of Computer Science and Information Engineering, National Cheng Kung University, No. 1, University Road, Tainan, 701, Taiwan

    Jo-Yi Chang, Chen-Yen Lin & Sun-Yuan Hsieh

  3. College of Mathematics and Informatics and the Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fuzhou, 350117, Fujian, People’s Republic of China

    Limei Lin

  4. Fujian Provincial Key Laboratory of Big Data Mining and Applications, School of Mathematics and Physics, Fujian University of Technology, Fuzhou, 350118, Fujian, People’s Republic of China

    Yanze Huang

  5. Department of Computer Science, University of Oklahoma, 660 Parrington Oval, Norman, OK, 73019, USA

    Krishnaiyan Thulasiraman

  6. Department of Computer Science and Information Engineering, National Chi Nan University, No. 1, Daxue Rd, Puli Township, Nantou County, 54561, Taiwan

    Sun-Yuan Hsieh

Authors
  1. Dun-Wei Cheng
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jo-Yi Chang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Chen-Yen Lin
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Limei Lin
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Yanze Huang
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Krishnaiyan Thulasiraman
    View author publications

    You can also search for this author inPubMed Google Scholar

  7. Sun-Yuan Hsieh
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Sun-Yuan Hsieh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cheng, DW., Chang, JY., Lin, CY. et al. Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure. J Supercomput 79, 5037–5063 (2023). https://doi.org/10.1007/s11227-022-04841-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04841-5

Keywords