On the applications of Dijkstra’s shortest path algorithm in software defined networks

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

You may have access to this PDF.

Abstract

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.

Cite

CITATION STYLE

APA

Galinac Grbac, T., & Domazet, N. (2017). On the applications of Dijkstra’s shortest path algorithm in software defined networks. Studies in Computational Intelligence, 737, 39–45. https://doi.org/10.1007/978-3-319-66379-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free