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.