Skip to main content
SpringerLink
Log in

Path optimization of box-covering based routing to minimize average packet delay in software defined network

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

A routing algorithm plays a major role in Data communication across an inter-network. Software-Defined Networking (SDN) is a new era of computer networking that separates Data plane from Control plane which controls, changes and manages the network behavior dynamically via open interfaces with the help of SDN Controllers. In SDN, the networking devices route packets in the form of flows with the help of flow rules given by the controllers and the flow rules are stored in the corresponding flow tables of the networking devices. The Box-Covering (BC) algorithm is an existing algorithm used in SDN for achieving renormalization of networks by calculating the fractal dimension of networks and covering the network with the minimum possible number of boxes and Dijkstra’s algorithm is used for calculating shortest paths. The proposed work focuses on Path Optimization in the Box-Covering-Based Routing (BCR) algorithm, which is an existing algorithm used in large-scale SDN. In the proposed work, a Link-Weight system has been used for bounding the Link Utilization of the shortest path between the Source and the Destination to minimize the Average Packet Delay in the Network. The results show that the proposed work reduces the Average Packet Delay compared to the existing algorithms such as Dijkstra’s algorithm, Graph Compression algorithm and BCR algorithm and also improves the performance of the network.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Xia W, Wen Z, Foh CH, Niyato D, Xie H (2015) A survey on software defined networking. IEEE Commun Surveys Tuts 17(1):27–51

    Article  Google Scholar 

  2. Yeganeh SH, Tootoonchian A, Ganjali Y (2013) On scalability of software defined networking. IEEE Commun Mag 51(2):136–141

    Article  Google Scholar 

  3. Cheng G, Chen H, Hu H, Wang Z (2017) Toward a scalable SDN control mechanism via switch migration. China Communications 14(1):111–123

    Article  Google Scholar 

  4. Tootoonchian A, Ganjali Y (2010) Hyperflow: A distributed control plane for OpenFlow. Proc. Internet Netw. Manag. Conf. Res. Enterprise Netw (INM). 1–6

  5. Cheng L-W, Wang S-Y (2015) Application-aware SDN routing for big data networking. 2015 IEEE Global Communications Conference (GLOBECOM) 1–6

  6. Quan W, Cheng N, Qin M, Zhang H, Chan HA, Shen X (2018) Adaptive transmission control for software defined vehicular networks. IEEE Wireless Communications Letters:1–4

  7. Quan W, Liu Y, Zhang H, Yu S (2017) Enhancing crowd collaborations for software defined vehicular networks. IEEE Commun Mag 55(8):80–86

    Article  Google Scholar 

  8. Iqbal A, Javed U, Saleh S, Kim J, Alowibdi JS, Ilyas MU (2017) Analytical modeling of end-to-end delay in OpenFlow based networks. IEEE Access 5:6859–6871

    Article  Google Scholar 

  9. Caria M, Jukan A, Hoffmann M (2016) SDN partitioning: a centralized control plane for distributed routing protocols. IEEE Trans Netw Serv Manag 13(3):381–393

    Article  Google Scholar 

  10. Challa R, Jeon S, Kim DS, Choo H (2017) CentFlow: centrality-based flow balancing and traffic distribution for higher network utilization. IEEE Access 5:17045–17058

    Article  Google Scholar 

  11. Yu C, Lan J, Guo Z, Hu Y (2018) DROM: optimizing the routing in software-defined networks with deep reinforcement learning. IEEE Access 6:64533–64539

    Article  Google Scholar 

  12. Achleitner S, Bartolin N, He T, La Porta T, Tootaghaj DZ (2018) Fast network configuration in software defined networking. IEEE Trans Netw Serv Manag 15(4):1249–1263

    Article  Google Scholar 

  13. Chemodanov D, Esposito F, Calyam P, Sukhov A (2019) A constrained shortest path scheme for virtual network service management. IEEE Trans Netw Serv Manag 16(1):127–142

    Article  Google Scholar 

  14. Li Z, Ji L, Huang R, Liu S (2018) Improving centralized path calculation based on graph compression. China Communications 15(6):120–124

    Article  Google Scholar 

  15. Zhang L, Deng Q, Su Y, Hu Y (2017) A box-covering-based routing algorithm for large-scale SDNs. IEEE Access 5:4048–4056

    Article  Google Scholar 

  16. Medhi D, Ramasamy K (2007) Network routing algorithms, Protocols and Architectures. Elsevier Inc., Amsterdam

    Google Scholar 

  17. Pioro M, Medhi D (2004) Routing, flow, and capacity Design in Communication and Computer Networks. Elsevier Inc., Amsterdam

    MATH  Google Scholar 

  18. McCabe JD (2007) Network analysis, architecture, and design. Elsevier Inc., Amsterdam

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Communication, Thiagarajar College of Engineering, Madurai, Tamil Nadu, India

    UmaMaheswari Gurusamy, K. Hariharan & M. S. K. Manikandan

Authors
  1. UmaMaheswari Gurusamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Hariharan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. S. K. Manikandan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to UmaMaheswari Gurusamy.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gurusamy, U., Hariharan, K. & Manikandan, M.S.K. Path optimization of box-covering based routing to minimize average packet delay in software defined network. Peer-to-Peer Netw. Appl. 13, 932–939 (2020). https://doi.org/10.1007/s12083-019-00855-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-019-00855-8

Keywords

Search

Navigation