Evaluating an Application Aware Distributed Dijkstra Shortest Path Algorithm in Hybrid Cloud/Edge Environments

To increase the flexibility and the dynamism of communication networks, Software Defined Networking (SDN) has emerged as the challenging approach to decouple control and data planes, using a logically centralized controller able to manage the underlying network resources. However, traditional network solutions can not be always used in SDN. In this paper, we deal with routing issued in the setup of dynamic SDNs spanning Fog/Edge and IoT systems for the support of new generation applications. In particular, we propose a modified version of the Dijkstra's routing algorithm that can optimize complex routing metrics and uses MapReduce to speed up the configuration of routers in the network. The system can optimize the packet routing in according to different parameters including, e.g., hops, latency, and energy efficiency policies. In order to validate our work, we performed evaluations on the revised MapReduce version of the Dijkstra routing algorithm considering a high scalable network topology with thousands of virtual nodes.