Skip to main content

Dynamic Routing in Software-Defined Networks

  • Conference paper
  • First Online:
Emerging Research in Electronics, Computer Science and Technology

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 545))

  • 2258 Accesses

Abstract

The Internet is definitely the greatest contributor to globalization which has brought together the whole world and has made every nook and corner attainable. The conventional IP networks have not been able to serve the purpose of a simplified infrastructure even after their extensive acquisition. Service provider networks are not fully fledged in providing (1) fast switching in the core network without any routing lookup, load balancing and retort to faults, (2) reorganize the network according to prevailing network policies and terms simultaneously. Software-defined network (SDN) which operates on OpenFlow protocol is a revolution in networking which aims to remodel the traditional network by disintegrating the data and control planes. It bifurcates the control logic from the various network devices like routers and switches, by providing a core supervisory control logic for the entire network and delivering aptness to code the network. In traditional routing, the information is flooded to the entire network which causes overutilization of resources, high bandwidth requirements, and many other drawbacks. Compared to the legacy routing, SDN is more effective in route computations and provides complete control for packet transmission. The paper proposes a method to find the shortest path routing between the source and destination using the Bellman–Ford routing algorithm. Secondly, the routing emulations for various network topologies are presented and compared using Mininet which implements routing for SDN. The comparative analysis of both the scenarios shows that the routing algorithm proposed in this paper contributes utmost QoS.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.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. Kreutz D, Ramos FMV, Veríssimo PE, Rothenberg CE, Azodolmolky S, Uhlig S (Jan 2015) Software-defined networking: a comprehensive survey. In: Proceedings of IEEE, vol 103, no 1, pp 14–76. https://doi.org/10.1109/jproc.2014.2371999

  2. Zhang H, Yan J (2015) Performance of SDN routing in comparison with legacy routing protocols. In: 2015 international conference on cyber-enabled distributed computing and knowledge discovery, Xi’an, pp 491–494. https://doi.org/10.1109/cyberc.2015.30

  3. Home—Mininet. https://www.mininet.org/. Accessed 28 May 2018

  4. Mulla MM, Narayan DG, Meena SM. Load balancing for software-defined networks

    Google Scholar 

  5. Waleed S, Faizan M, Iqbal M, Anis MI (2017) Demonstration of single link failure recovery using Bellman Ford and Dijikstra algorithm in SDN. In: 2017 international conference on innovations in electrical engineering and computational technologies (ICIEECT), Karachi, pp 1–4. https://doi.org/10.1109/icieect.2017.7916533

  6. Open Networking Foundation. https://www.opennetworking.org. Accessed 28 May 2018

  7. Home—Iperf. https://iperf.fr

  8. Jarraya Y, Madi T, Debbabi M (Fourthquarter 2014) A survey and a layered taxonomy of software-defined networking. IEEE Commun Surv Tutor 16(4):1955–1980. https://doi.org/10.1109/comst.2014.2320094

  9. Magzhan K, Jani HM (2013) A review and evaluations of shortest path algorithms. Int J Sci Technol Res 2(6)

    Google Scholar 

  10. Feamster N, Rexford J, Zegura E (2014) The road to SDN: an intellectual history of programmable networks. ACM SIGCOMM Comput Commun Rev 87–98

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohammed Moin Mulla .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mulla, M.M., Khot, A., Patil, A., Chandani, D.G. (2019). Dynamic Routing in Software-Defined Networks. In: Sridhar, V., Padma, M., Rao, K. (eds) Emerging Research in Electronics, Computer Science and Technology. Lecture Notes in Electrical Engineering, vol 545. Springer, Singapore. https://doi.org/10.1007/978-981-13-5802-9_89

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-5802-9_89

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-5801-2

  • Online ISBN: 978-981-13-5802-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics