Availability analysis of resilient geometric routing on Internet topology

Scalable routing schemes for large-scale networks, especially future Internet, are required. Geometric routing scheme is a promising candidate to solve the scalability issue of routing tables in conventional IP routing based on longest prefix matching. In this scheme, network nodes are assigned virtual coordinates and packets are forwarded towards their intended destination following a distance-decreasing policy. Dynamics in the network such as node/link failures might affect this forwarding and lead packets to a dead end. We proposed recovery techniques in geometric routing to deliver packets to the destination in case of failures. In this paper, we perform an analysis on the availability of the proposed protection techniques on the Internet graph. The routing scheme over optical transport network is considered and the reliability data of physical components and a known network availability model are used. This evaluation is compared with the shortest cycle scheme which finds two node disjoint paths between every source and destination in the topology and also with geometric routing with no protection. The results show that the proposed scheme performs reasonably well compared to the shortest cycle scheme and significantly enhances the availability compared to geometric routing without any protection.