Skip to main content
SpringerLink
Log in

Disaster-Resilient Routing Schemes for Regional Failures

  • Chapter
  • First Online:
Guide to Disaster-Resilient Communication Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

Large-scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical distance value D is imposed between any intermediate element of one path and any element of the other path, is presented. Next, the problem of the calculation of a D-geodiverse routing solution which ensures a certain level of availability is tackled. An algorithm is described that either obtains a solution to that problem or the most available path pair satisfying the desired geographical distance value D—this can be useful for the specification of availability levels in Service Level Agreements. Finally, a case study is presented, in an optical network, to determine the cost increase in terminal equipment (transponders) of approaches to ensure a much larger separation of the paths (of the selected path pair), with respect to minimal length link-disjoint routing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note that the number of link crossings is \(x \ll |V|\) for backbone networks, with typical networks containing (almost) no link crossings. The maximum \(D=D_{sd}^{\text {Max}}\) value for which a pair of D-geodiverse paths exists can be calculated via a binary search using the algorithm of [28].

References

  1. Ashraf MW, Idrus SM, Iqbal F (2018) Maximally spatial-disjoint lightpaths in optical networks. Indones J Electr Eng Comput Sci 10(2):733–740

    Article  Google Scholar 

  2. Ashraf MW, Idrus SM, Iqbal F, Butt RA (2018) On spatially disjoint lightpaths in optical networks. Photon Netw Commun 36(11):11–25

    Article  Google Scholar 

  3. Beshir A, Kuipers F, Orda A, Van Mieghem P (2012) Survivable routing and regenerator placement in optical networks. In: IV International Congress on Ultra Modern Telecommunications and Control Systems (ICUMT 2012), St. Petersburg, Russia, pp 684–690

    Google Scholar 

  4. Cheng Y, Gardner MT, Li J, May R, Medhi D, Sterbenz JPG (2014) Optimised heuristics for a geodiverse routing protocol. In: 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN), pp 1–9

    Google Scholar 

  5. Cheng Y, Gardner MT, Li J, May R, Medhi D, Sterbenz JPG (2015) Analysing geopath diversity and improving routing performance in optical networks. Comput Netw 82:50–67

    Google Scholar 

  6. Cheng Y, Li J, Sterbenz JPG (2013) Path geo-diversification: design and analysis. In: 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp 46–53

    Google Scholar 

  7. Cheng Y, Medhi D, Sterbenz JPG (2015) Geodiverse routing with path delay and skew requirement under area-based challenges. Networks 66(4):335–346

    Article  MathSciNet  Google Scholar 

  8. Cheng Y, Sterbenz JPG (2015) Critical region identification and geodiverse routing protocol under massive challenges. In: 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM), pp 14–20

    Google Scholar 

  9. de Sousa A, Gomes T, Girão-Silva R, Martins L (2019) Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience. Opt Switch Netw 31:127–143

    Article  Google Scholar 

  10. de Sousa A, Gomes T, Girão-Silva R, Martins L (2017) Minimizing the network availability upgrade cost with geodiversity guarantees. In: 2017 9th International Workshop on Resilient Networks Design and Modeling (RNDM), pp 1–8

    Google Scholar 

  11. de Sousa A, Santos D, Monteiro P (2017) Determination of the minimum cost pair of \(D\)-geodiverse paths. In: DRCN 2017—13th International Conference on the Design of Reliable Communication Networks, Munich, Germany

    Google Scholar 

  12. Dikbiyik F, Reaz AS, De Leenheer M, Mukherjee B (2012) Minimizing the disaster risk in optical telecom networks. In: OFC/NFOEC, pp 1–3

    Google Scholar 

  13. Dikbiyik F, Tornatore M, Mukherjee B (2014) Minimizing the risk from disaster failures in optical backbone networks. J Lightwave Technol 32(18):3175–3183

    Article  Google Scholar 

  14. Girão-Silva R, Nedic B, Gunkel M, Gomes T (2020) Shared Risk Link Group disjointness and geodiverse routing: a trade-off between benefit and practical effort. Networks (in press)

    Google Scholar 

  15. Gomes T, Craveirinha J (2007) Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks. Eur J Oper Res 182(3):1055–1064

    Article  MATH  Google Scholar 

  16. Gomes T, Jorge L, Melo P, Girão-Silva R (2016) Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach. Photon Netw Commun 31(1):11–22

    Article  Google Scholar 

  17. Gomes T, Simões C, Fernandes L (2013) Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost. Telecommun Syst 52(2):737–749

    Google Scholar 

  18. Grünthal G (1998) European macroseismic scale 1998 (EMS-98). Cahiers du Centre Européen de Géodynamique et de Séismologie 15

    Google Scholar 

  19. http://www.deec.uc.pt/~teresa/rndm2018 (2018)

  20. Hu JQ (2003) Diverse routing in optical mesh networks. IEEE Trans Commun 51(3):489–494

    Article  Google Scholar 

  21. IBM ILOG CPLEX Optimization Studio V12.8. IBM (2017)

    Google Scholar 

  22. Iqbal F, Kuipers FA (2015) Disjoint paths in networks (invited paper). Wiley encyclopedia of electrical and electronics engineering. Wiley

    Google Scholar 

  23. Kobayashi Y, Otsuki K (2014) Max-flow min-cut theorem and faster algorithms in a circular disk failure model. In: IEEE INFOCOM 2014—IEEE Conference on Computer Communications, pp 1635–1643

    Google Scholar 

  24. Laborczi P, Tapolcai J, Ho PH, Cinkler T, Recski A, Mouftah HT (2001) Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Cinkler T (ed) Proceedings of Design of Reliable Communication Networks (DRCN), Budapest, Hungary, pp 220–227

    Google Scholar 

  25. Martins E, Pascoal M, Santos J (1999) Deviation algorithms for ranking shortest paths. Int J Found Comput Sci 10(3):247–263

    Article  MathSciNet  MATH  Google Scholar 

  26. Nedic B, Gunkel M, Gomes T, Girão-Silva R (2018) SRLG-disjointness and geodiverse routing—a practical network study and operational conclusions. In: 10th International Workshop on Resilient Networks Design and Modeling (RNDM 2018). Longyearbyen, Svalbard (Spitsbergen), Norway, pp 1–8

    Google Scholar 

  27. Oguz M, Dikbiyik F, Kuyuk HS (2016) Earthquake preparedness strategies for telecom backbone with integration of early warning systems and optical WDM networks. In: 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), pp 181–188

    Google Scholar 

  28. Otsuki K, Kobayashi Y, Murota K (2016) Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network. Eur J Oper Res 248(2):396–403

    Article  MathSciNet  MATH  Google Scholar 

  29. Poggiolini P, Carena A, Curri V, Bosco G, Forghieri F (2011) Analytical modeling of nonlinear propagation in uncompensated optical transmission links. IEEE Photonics Technol Lett 23(11):742–744

    Article  Google Scholar 

  30. Sen A, Murthy S, Banerjee S (2009) Region-based connectivity—a new paradigm for design of fault-tolerant networks. In: 2009 International Conference on High Performance Switching and Routing, Paris, France, pp 1–7

    Google Scholar 

  31. Song L, Zhang J, Mukherjee B (2008) A comprehensive study on backup-bandwidth reprovisioning after network-state updates in survivable telecom mesh networks. IEEE/ACM Trans Netw 16(6):1366–1377

    Article  Google Scholar 

  32. Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14(2):325–336

    Article  MathSciNet  MATH  Google Scholar 

  33. Tapolcai J, Rónyai L, Vass B, Gyimóthi L (2017) List of shared risk link groups representing regional failures with limited size. In: IEEE INFOCOM 2017—IEEE Conference on Computer Communications, pp 1–9

    Google Scholar 

  34. 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

    Google Scholar 

  35. Trajanovski S, Kuipers FA, Ilić A, Crowcroft J, Van Mieghem P (2015) Finding critical regions and region-disjoint paths in a network. IEEE/ACM Trans Netw 23(3):908–921

    Article  Google Scholar 

  36. Tsubaki T, Ishizuka M, Yasukawa S (2018) A new algorithm of route design against large-scale disasters. In: NOMS 2018—2018 IEEE/IFIP Network Operations and Management Symposium, Taipei, Taiwan, pp 1–5

    Google Scholar 

  37. Vass B, Bérczi-Kovács E, Tapolcai J (2017) Enumerating shared risk link groups of circular disk failures hitting \(k\) nodes. In: DRCN 2017—13th International Conference on the Design of Reliable Communication Networks, Munich, Germany, pp 1–9

    Google Scholar 

  38. Vass B, Németh L, Tapolcai J (2020) The Earth is nearly flat: precise and approximate algorithms for detecting vulnerable regions of networks in plane and on sphere. Networks (in press)

    Google Scholar 

  39. Wang J, Bigham J, Phillips C (2017) A geographical proximity aware multi-path routing mechanism for resilient networking. IEEE Commun Lett 21(7):1533–1536

    Article  Google Scholar 

  40. Yen JY (1971) Finding the \(k\) shortest loopless paths in a network. Manag Sci 17(11):712–716

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This chapter is based on work from COST Action CA15127 (“Resilient communication services protecting end-user applications from disaster-based failures—RECODIS”) supported by COST (European Cooperation in Science and Technology). This work is funded by ERDF Funds through the Centre’s Regional Operational Program and by National Funds through the FCT—Fundação para a Ciência e a Tecnologia, I.P. under the project CENTRO-01-0145-FEDER-029312. This work was also partially supported by FCT under project UIDB/00308/2020. D. Santos was supported by the FCT post-doc grant SFRH/BPD/111503/2015 until November 2018. This work was partially supported by the High-Speed Networks Laboratory (HSNLab). Projects No. 123957, 129589, 124171, and 128062 have been implemented with the support provided from the National Research, Development and Innovation Fund of Hungary, financed under the FK_17, KH_18, K_17, and K_18 funding schemes, respectively. The work was also supported by the BME-Artificial Intelligence FIKP grant of EMMI (BME FIKP-MI/SC).

Author information

Authors and Affiliations

  1. University of Coimbra, INESC Coimbra, Department of Electrical and Computer Engineering, Rua Sílvio Lima, 3030-290, Coimbra, Portugal

    Teresa Gomes, Rita Girão-Silva & Lúcia Martins

  2. INESC Coimbra, DEEC, Rua Sílvio Lima, Polo II, 3030-290, Coimbra, Portugal

    Dorabella Santos

  3. Department of Mathematics and Natural Sciences, Darmstadt University of Applied Sciences, Darmstadt, Germany

    Boro Nedic

  4. Optical Transport Core, Deutsche Telekom Technik GmbH, Darmstadt, Germany

    Matthias Gunkel

  5. High-Speed Networks Laboratory (HSNLab), MTA-BME Future Internet Research Group, Budapest University of Technology and Economics, Magyar tudosok korutja 2, Budapest, 1117, Hungary

    Balázs Vass & János Tapolcai

  6. Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, G. Narutowicza 11/12, 80-233, Gdańsk, Poland

    Jacek Rak

Authors
  1. Teresa Gomes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dorabella Santos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rita Girão-Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lúcia Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Boro Nedic
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Matthias Gunkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Balázs Vass
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. János Tapolcai
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Jacek Rak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Teresa Gomes .

Editor information

Editors and Affiliations

  1. Department of Computer Communications, Gdańsk University of Technology, Gdańsk, Poland

    Jacek Rak

  2. School of Computing and Communications, Lancaster University, Lancaster, UK

    David Hutchison

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Gomes, T. et al. (2020). Disaster-Resilient Routing Schemes for Regional Failures. In: Rak, J., Hutchison, D. (eds) Guide to Disaster-Resilient Communication Networks. Computer Communications and Networks. Springer, Cham. https://doi.org/10.1007/978-3-030-44685-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-44685-7_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-44684-0

  • Online ISBN: 978-3-030-44685-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation