Shared Risk Link Group disjointness and geodiverse routing: A trade‐off between benefit and practical effort

[1]  Jacek Rak,et al.  Disaster-resilient communication networks: Principles and best practices , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[2]  Stefano Secci,et al.  A survey of strategies for communication networks to protect against large-scale natural disasters , 2016, 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM).

[3]  Jiannong Cao,et al.  Divide and Conquer for Fast SRLG Disjoint Routing , 2018, 2018 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[4]  Siavash Khorsandi,et al.  CoSE: A SRLG-Disjoint Routing Algorithm , 2007, Fourth European Conference on Universal Multiservice Networks (ECUMN'07).

[5]  Yi Zhu,et al.  Reliable Collective Communications With Weighted SRLGs in Optical Networks , 2012, IEEE/ACM Transactions on Networking.

[6]  Deep Medhi,et al.  Analysing GeoPath diversity and improving routing performance in optical networks , 2015, Comput. Networks.

[7]  Rita Girão-Silva,et al.  SRLG-disjointness and geodiverse routing – a practical network study and operational conclusions , 2018, 2018 10th International Workshop on Resilient Networks Design and Modeling (RNDM).

[8]  Piet Van Mieghem,et al.  Survivable routing and regenerator placement in optical networks , 2012, 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems.

[9]  A. Todimala,et al.  IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[10]  Wanyi Gu,et al.  Survivable multipath routing and resource assignment with SRLG in virtual optical networks , 2016, 2016 Optical Fiber Communications Conference and Exhibition (OFC).

[11]  James P. G. Sterbenz,et al.  Critical region identification and geodiverse routing protocol under massive challenges , 2015, 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM).

[12]  Joao Pedro,et al.  Impact of client- and line-side flexibility in the lifecycle of next-generation transport networks [Invited] , 2016, IEEE/OSA Journal of Optical Communications and Networking.

[13]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[14]  Abdul Jabbar,et al.  Path diversification for future internet end-to-end resilience and survivability , 2014, Telecommun. Syst..

[15]  João C. N. Clímaco,et al.  An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks , 2016, Telecommun. Syst..

[16]  Rita Girão-Silva,et al.  Maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks: a lexicographic approach , 2016, Photonic Network Communications.

[17]  Deep Medhi,et al.  Geodiverse routing with path delay and skew requirement under area‐based challenges , 2015, Networks.

[18]  João C. N. Clímaco,et al.  On the bicriterion - minimal cost/minimal label - spanning tree problem , 2010, Eur. J. Oper. Res..

[19]  Deep Medhi,et al.  Optimised heuristics for a geodiverse routing protocol , 2014, 2014 10th International Conference on the Design of Reliable Communication Networks (DRCN).

[20]  Sofie Verbrugge,et al.  RECODIS: Resilient Communication Services Protecting End-user Applications from Disaster-based Failures , 2016, 2016 18th International Conference on Transparent Optical Networks (ICTON).

[21]  Branko Mikac,et al.  Optimizing maximum shared risk link group disjoint path algorithm using NVIDIA CUDA heterogeneous parallel programming platform , 2014, 2014 X International Symposium on Telecommunications (BIHTEL).

[22]  James P. G. Sterbenz,et al.  Path geo-diversification: Design and analysis , 2013, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[23]  Lajos Rónyai,et al.  List of shared risk link groups representing regional failures with limited size , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[24]  P. Poggiolini,et al.  Analytical Modeling of Nonlinear Propagation in Uncompensated Optical Transmission Links , 2011, IEEE Photonics Technology Letters.

[25]  Rizwan Aslam Butt,et al.  On spatially disjoint lightpaths in optical networks , 2018, Photonic Network Communications.

[26]  Jian-Qiang Hu,et al.  Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..

[27]  Piet Van Mieghem,et al.  Assortativity in complex networks , 2015, J. Complex Networks.

[28]  Mohammad Javad Rostami,et al.  MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization , 2012, J. Netw. Comput. Appl..

[29]  Teresa Gomes,et al.  Resilient routing in optical networks using SRLG-disjoint path pairs of min-sum cost , 2011, Telecommunication Systems.

[30]  Chunming Qiao,et al.  On finding disjoint paths in single and dual link cost networks , 2004, IEEE INFOCOM 2004.