On the Applications of Dijakstra's Shortest Path algorithm in Software Defined Networks (CROSBI ID 649997)
Prilog sa skupa u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Galinac Grbac, Tihana ; Domazet, Nikola ;
engleski
On the Applications of Dijakstra's Shortest Path algorithm in Software Defined Networks
The software defined networking has opened new opportuni- ties 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 dynam- ically. 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.
Software Defined Network, routing control algorithm
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
39-45.
2017.
nije evidentirano
objavljeno
Podaci o matičnoj publikaciji
Studies in computational intelligence
Springer
978-3-319-66378-4
1860-949X
1860-9503
Podaci o skupu
11th International Symposium on Intelligent and Distributed Computing
predavanje
11.10.2017-13.10.2017
Beograd, Srbija