A Safety-Enhanced Dijkstra Routing Algorithm via SDN Framework

Abstract

Dijkstra algorithm is widely used in network routing protocols, like IS-IS routing protocol. We consider the security problems in Dijkstra caused by routing on the vulnerable communication links. This work employs a software defined networks (SDN) framework to mitigate the vulnerable links while maintaining satisfactory QoS of packets transition process. SDN is able to maintain an overall network awareness, through which a controller is capable of optimizing routing based on metrics of safety interest. The routing security problem is formulated as a double constraint shortest path problem where dynamic delay is the QoS metric with an additional constraint of link vulnerability. The proposed framework is shown, in different test cases, to be able to maintain QoS while mitigating link insecurities.