On the Applications of Dijkstra’s Shortest Path Algorithm in Software Defined Networks
The software defined networking has opened new opportunities for offering network resources to end users “as a service”. For these purposes a number of technologies have been proposed and implemented to enable easy definition and management of network resources dynamically. In this paper we provide an overview of software defined network and technologies used for identifying network topology. We present three approaches based on Dijkstra’s Shortest Path Algorithm and evaluate their performance in an experimental study.
KeywordsSoftware defined network Network topology Dijkstra’s shortest path algorithm Dynamic network definition and management
This work has been supported in part by Croatian Science Foundation’s project EVOSOFT UIP-2014-09-7945 and by the Univ. of Rijeka Res. Grant 13.09.2.2.16.
- 2.Jiang, J.R., Huang, H.W., Liao, J.H., Chen, S.Y.: Extending Dijkstra’s shortest path algorithm for software defined networking. In: The 16th Asia-Pacific Network Operations and Management Symposium, pp. 1–4, Sept 2014Google Scholar
- 4.Nunes, B.A.A., Mendonca, M., Nguyen, X.N., Obraczka, K., Turletti, T.: A survey of software-defined networking: past, present, and future of programmable networks. IEEE Commun. Surv. Tutorials 16(3), 1617–1634 (2014)Google Scholar
- 5.Osseiran, A., Monserrat, J.F., Marsch, P.: 5G Mobile and Wireless Communications Technology, 1st edn. Cambridge University Press, New York, NY, USA (2016)Google Scholar
- 6.Ryu Project Team: RYU SDN Framework. https://www.osrggithubio/ryu-book/en/html/. Accessed 15 May 2017
- 7.Ryu Project Team: Ryu pre-installed VM image files. https://www.sourceforgenet/projects/ryu/files/vmimages/OpenFlowTutorial/. Accessed 15 May 2017