Skip to main content

On the Applications of Dijkstra’s Shortest Path Algorithm in Software Defined Networks

  • Chapter
  • First Online:
Intelligent Distributed Computing XI (IDC 2017)

Part of the book series: Studies in Computational Intelligence ((SCI,volume 737))

Included in the following conference series:

  • 834 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Dijkstra, E.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  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 2014

    Google Scholar 

  3. Matsubara, D., Egawa, T., Nishinaga, N., Kafle, V.P., Shin, M.K., Galis, A.: Toward future networks: a viewpoint from ITU-T. IEEE Commun. Mag. 51(3), 112–118 (2013)

    Article  Google 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

Download references

Acknowledgements

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tihana Galinac Grbac .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Cite this chapter

Galinac Grbac, T., Domazet, N. (2018). On the Applications of Dijkstra’s Shortest Path Algorithm in Software Defined Networks. In: Ivanović, M., Bădică, C., Dix, J., Jovanović, Z., Malgeri, M., Savić, M. (eds) Intelligent Distributed Computing XI. IDC 2017. Studies in Computational Intelligence, vol 737. Springer, Cham. https://doi.org/10.1007/978-3-319-66379-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66379-1_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66378-4

  • Online ISBN: 978-3-319-66379-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics