Optimised heuristics for a geodiverse routing protocol

We propose two heuristics for solving the path geodiverse problem (PGD), in which the calculation of a number of geographically separated paths is required. The geodiverse paths can be used to circumvent physical challenges such as large-scale disasters in telecommunication networks. The heuristics we propose for solving PGD have significantly less complexity compared to the optimal algorithm we previously used while still performing well by returning multiple geodiverse paths for each node pair. The geodiverse paths contribute to providing resilience against regional challenges. We present the GeoDivRP routing protocol with two new routing heuristics implemented, which provide the end nodes with multiple geographically diverse paths and demonstrates better performance compared to OSPF when the network is subject to area-based challenges.

[1]  Damien Magoni,et al.  Tearing down the Internet , 2003, IEEE J. Sel. Areas Commun..

[2]  K ÇetinkayaEgemen,et al.  Modelling communication network challenges for Future Internet resilience, survivability, and disruption tolerance , 2013 .

[3]  Erhan Erkut,et al.  On finding dissimilar paths , 2000, Eur. J. Oper. Res..

[4]  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).

[5]  James P. G. Sterbenz,et al.  Modelling communication network challenges for Future Internet resilience, survivability, and disruption tolerance: a simulation-based approach , 2013, Telecommun. Syst..

[6]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[7]  Abdul Jabbar,et al.  Path diversification: A multipath resilience mechanism , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

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

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

[10]  David Hutchison,et al.  Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines , 2010, Comput. Networks.

[11]  Santosh S. Vempala,et al.  Path splicing , 2008, SIGCOMM '08.

[12]  Dimitri Papadimitriou,et al.  Network Working Group Rsvp-te Extensions in Support of End-to-end Generalized Multi-protocol Label Switching (gmpls) Recovery , 2006 .

[13]  Michael Kuby,et al.  A minimax method for finding the k best "differentiated" paths , 2010 .

[14]  George F. Riley,et al.  The ns-3 Network Simulator , 2010, Modeling and Tools for Network Simulation.

[15]  Julia Kastner,et al.  Survivable Networks Algorithms For Diverse Routing , 2016 .

[16]  Linda K. Nozick,et al.  Identifying geographically diverse routes for the transportation of hazardous materials , 2008 .

[17]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[18]  James P. G. Sterbenz,et al.  On the fitness of geographic graph generators for modelling physical level topologies , 2013, 2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[19]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[20]  John Moy,et al.  OSPF specification , 1989, Request for Comments.

[21]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[22]  David Hutchison,et al.  Redundancy, diversity, and connectivity to achieve multilevel network resilience, survivability, and disruption tolerance invited paper , 2014, Telecommunication Systems.

[23]  Abraham Duarte,et al.  Heuristics for the bi-objective path dissimilarity problem , 2009, Comput. Oper. Res..