Skip to main content
SpringerLink
Log in

Fast and efficient algorithm for delay-sensitive QoS provisioning in SDN networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Adoption of Software-Defined Networks(SDN) as a new networking paradigm, promises solutions for Quality of Service(QoS) management issues raised at the service providers level due to the massive increase in connected devices (e.g., Servers, Mobile devices, M2M, Things, etc.), traffic in between, and the diverse user and service demands (e.g., delay, bandwidth, etc.). Although its advantage in network control flexibility compared to traditional networking, SDN still requires a design of robust and fast QoS guaranteeing routing algorithms due to its central control computation overhead. In this article, we present a new QoS-aware routing algorithm designed to work on top of SDN and serves delay-sensitive services that require certain delay requirements with low computation time. Such problems are usually modeled as Delay Constrained Least Cost (DCLC) problem which is a well-known NP-hard problem. We adopted the Lagrangian relaxation-based approach that incorporates the delay constraint into the objective cost function to solve the DCLC problem. Differently than existing Lagrangian relaxation-based algorithms, we designed our algorithm to reduce the solution search space by exploiting the problem lower-bound cost and delay paths. Moreover, we defined three different constraint tightness factors inferred from the problem current state to avoid extra non-useful Dijkstra calls. To improve the solution quality, we propose a novel approach that use state information obtained from previous optimization iterations to obtain a small-size network subgraph. Then it search the obtained subgraph for a better solution that the Lagrangian relaxation-based approach may miss. We performed an extensive python-based simulation to evaluate the performance of MODLARAC and compared it with two Lagrangian relaxation-based heuristic algorithms proposed in the literature to solve the DCLC problem, LARAC, and BiLAD algorithms. The obtained results showed improvement up to a 15% reduction in internal Dijkstra calls count with about a 2% increase in the total path cost compared to those obtained by the optimal solution.

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
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Bezahaf, M., Hutchison, D., King, D., & Race, N. (2020). Internet evolution: Critical issues. IEEE Internet Computer, 6, 1–1.

    Google Scholar 

  2. Cisco. (2020). Cisco Annual Internet Report (2018–2023).

  3. Henni, D. E., Ghomari, A., & Hadjadj-Aoul, Y. (2020). A consistent QoS routing strategy for video streaming services in SDN networks. International Journal of Communication Systems, 33(10), e4177.

    Article  Google Scholar 

  4. Braden, R., Clark, D., Shenker, S. (1994). Integrated services in the internet architecture: An overview.

  5. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W. (1998). An architecture for differentiated services.

  6. ONF. “SDN architecture”. Open Networking Foundation, Menlo Park, USA 2016.

  7. Parsaei, M. R., Boveiri, H. R., Javidan, R., & Khayami, R. (2020). Telesurgery QoS improvement over SDN based on a Type-2 fuzzy system and enhanced cuckoo optimization algorithm. International Journal of Communication Systems, 33(11), e4426.

    Article  Google Scholar 

  8. Chekired, D. A., Togou, M. A., Khoukhi, L., & Ksentini, A. (2019). 5G-slicing-enabled scalable SDN core network: Toward an ultra-low latency of autonomous driving service. IEEE Journal on Selected Areas in Communications, 37(8), 1769–1782.

    Article  Google Scholar 

  9. Chaudhary, R., Aujla, G. S., Garg, S., Kumar, N., & Rodrigues, J. J. (2018). SDN-enabled multi-attribute-based secure communication for smart grid in IIoT environment. IEEE Transactions on Industrial Informatics, 14(6), 2629–2640.

    Article  Google Scholar 

  10. Xiao, Y., Thulasiraman, K., Fang, X., Yang, D., & Xue, G. (2012). Computing a most probable delay constrained path: NP-hardness and approximation schemes. IEEE Transactions Computers, 61(5), 738–744.

    Article  MathSciNet  Google Scholar 

  11. Frangioni, A., Galli, L., & Scutellà, M. G. (2015). Delay-constrained shortest paths: Approximation algorithms and second-order cone models. Journal of Optimization Theory and Applications, 164(3), 1051–1077.

    Article  MathSciNet  Google Scholar 

  12. Guck, J. W., Van Bemten, A., Reisslein, M., & Kellerer, W. (2018). Unicast QoS routing algorithms for SDN: A comprehensive survey and performance evaluation. IEEE Communications Surveys Tutorials, 20(1), 388–418.

    Article  Google Scholar 

  13. Juttner, A., Szviatovski, B., Mécs, I., Rajkó, Z. (2001). Lagrange relaxation based method for the QoS routing problem. In Proceedings IEEE INFOCOM 2001. conference on computer communications. twentieth annual joint conference of the ieee computer and communications society (Cat. No. 01CH37213) (vol. 2, pp. 859-868) .

  14. Egilmez, H. E., & Tekalp, A. M. (2014). Distributed QoS architectures for multimedia streaming over software defined networks. IEEE Transactions Multimedia, 16(6), 1597–1609.

    Article  Google Scholar 

  15. Liang WE, Shen CA. (2017). A high performance media server and QoS routing for SVC streaming based on Software-Defined Networking. 2017 International Conference on Computing, Networking and Communications. ICNC 2017, (pp. 556–560).

  16. Zhao J, Hammad E, Farraj A, Kundur D. Network-aware QoS routing for smart grids using software defined networks. In: . 166. ; 2016 : 384–394.

  17. Van Bemten, A., Guck, J. W., Vizarreta, P., Machuca, C. M., Kellerer, W. (2018). LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains. 2018 4th IEEE Conference on Network Softwarization and Workshops NetSoft 2018 (NetSoft) (pp. 168–176).

  18. Walker, R. (1992). Implementing discrete mathematics: combinatorics and graph theory with Mathematica. Pp 334. 1990. ISBN 0-201-50943-1 (Addison-Wesley). Steven Skiena The Mathematical Gazette, 76(476), 286–288.

    Article  Google Scholar 

  19. Gangwal, A., Gupta, M., Gaur, M. S., Laxmi, V., & Conti, M. (2016). ELBA: Efficient layer based routing algorithm in SDN. (pp. 1-7).

  20. Lin, C., Wang, K., & Deng, G. (2017). A QoS-aware routing in SDN hybrid networks. Procedia Computer Sciencs, 110, 242–249.

    Article  Google Scholar 

  21. Akin, E., & Korkmaz, T. (2019). Comparison of routing algorithms with static and dynamic link cost in software defined networking (SDN). IEEE Access, 7, 148629–148644.

    Article  Google Scholar 

  22. Binsahaq, A., Sheltami, T. R., & Salah, K. (2019). A survey on autonomic provisioning and management of QoS in SDN networks. IEEE Access, 7, 73384–73435.

    Article  Google Scholar 

  23. Ben Attia, M., Nguyen, K. K., & Cheriet, M. (2018). QoS-aware software-defined routing in smart community network. Computer Networks, 147, 221–235.

    Article  Google Scholar 

  24. Floyd, R. W. (1962). Algorithm 97: Shortest path. Communications of the ACM, 5(6), 345.

    Article  Google Scholar 

  25. Liu, Z., Xu, G., Liu, P., Fu, X., & Liu, Y. (2019). Energy-efficient multi-user routing in a software-defined multi-hop wireless network. Future Internet, 11(6), 133. https://doi.org/10.3390/fi11060133

    Article  Google Scholar 

  26. Ji, L., He, S., Wu, W., Gu, C., Bi, J., & Shi, Z. (2021). Dynamic network slicing orchestration for remote adaptation and configuration in industrial IoT. IEEE Transactions on Industrial Informatics, 18, 1.

    Google Scholar 

  27. Varasteh, A., Madiwalar, B., Van Bemten, A., Kellerer, W., & Mas-Machuca, C. (2021). Holu: Power-aware and delay-constrained VNF placement and chaining. IEEE Transactions on Network and Service Management, 18(2), 1524–1539.

    Article  Google Scholar 

  28. Stachowiak, K., Weissenberg, J., & Zwierzykowski, P. (2011). Lagrangian relaxation in the multicriterial routing. In IEEE AFRICON conference (September) (pp. 13–15).

  29. Stachowiak, K., & Zwierzykowski, P. (2012). Lagrangian Relaxation and Linear Intersection Based QoS Routing Algorithm. International Journal of Electronics and Telecommunications, 58(4), 307–314.

    Article  Google Scholar 

  30. Agrawal, H., Grah, M., Gregory, M. (2007) Optimization of QoS routing. Proc. - 6th IEEE/ACIS International Conference on Computer and Information Science ICIS 2007; 1st IEEE/ACIS Int. Work. e-Activity, IWEA 2007 (Icis) , (pp. 598–602).

  31. Santos, L., Coutinho-Rodrigues, J., & Current, J. R. (2007). An improved solution algorithm for the constrained shortest path problem. Transportation Research Part B: Methodological, 41(7), 756–771.

    Article  Google Scholar 

  32. Varyani, N., Zhang, Z. L., Rangachari, M., & Dai, D. (2019). LADEQ: A fast lagrangian relaxation based algorithm for destination-based QoS routing. In IFIP/IEEE Symposium on integrated network and service management IM (pp. 462–468).

  33. Varyani N, Zhang Zl, Dai D. (2020). QROUTE: An efficient Quality of Service (QoS) routing scheme for software-defined overlay networks. IEEE Access, (p. 1)

  34. Kou, C., Hu, D., Yuan, J., & Ai, W. (2020). Bisection and exact algorithms based on the lagrangian dual for a single-constrained shortest path problem. IEEE/ACM Transactions Network, 28(1), 224–233.

    Article  Google Scholar 

  35. Howard, M. RESEARCH NOTE - IHS Markit: SDN deployed by 78% of global service providers at end of 2018. Available at https://techblog.comsoc.org/2019/01/28/ihs-markit-sdn-deployed-by-78-of-global-service-providers-at-end-of-2018/

  36. Schulz, P., Matthe, M., Klessig, H., et al. (2017). Latency critical IoT applications in 5G: Perspective on the design of radio interface and network architecture. IEEE Communications Magazine, 55(2), 70–78.

    Article  Google Scholar 

  37. Montazerolghaem, A., & Yaghmaee, M. H. (1952). Demand response application as a service: An SDN-based management framework. IEEE Transactions on Smart Grid, 2021, 13.

    Google Scholar 

  38. Marquezan, C. C, An, X., Despotovic, Z., Khalili, R., Hecker, A. (2016). Identifying latency factors in SDN-based mobile core networks. In: 2016-August. IEEE. (pp. 484–491).

  39. BinSahaq, A., Sheltami, T., Mahmoud, A., & Nasser, N. (2021). Bootstrapped LARAC algorithm for fast delay-sensitive QoS provisioning in SDN networks. International Journal of Communication Systems, 34, e4880.

    Article  Google Scholar 

  40. Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11), 712–716.

    Article  MathSciNet  Google Scholar 

  41. Gilbert, E. N. (1959). Random graphs. The Annals of Mathematical Statistics, 30(4), 1141–1144.

    Article  Google Scholar 

  42. Floodlight OpenFlow Controller. Available at https://floodlight.atlassian.net/

  43. ONF, OpenFlow Switch Specification. Available at https://www.opennetworking.org/wp-content/uploads/2014/10/openflow-spec-v1.3.0.pdf, Accessed On 2020-08-23

Download references

Author information

Authors and Affiliations

  1. Computer Engineering Department, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia

    Ahmed BinSahaq

  2. Computer Engineering Department, Interdisciplinary Research Center of Smart Mobility and Logistics, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia

    Tarek Sheltami & Ashraf Mahmoud

  3. College of Engineering, Alfaisal University, Riyadh, Saudi Arabia

    Nidal Nasser

Authors
  1. Ahmed BinSahaq
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tarek Sheltami
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ashraf Mahmoud
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nidal Nasser
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahmed BinSahaq.

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

BinSahaq, A., Sheltami, T., Mahmoud, A. et al. Fast and efficient algorithm for delay-sensitive QoS provisioning in SDN networks. Wireless Netw (2022). https://doi.org/10.1007/s11276-022-03028-3

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11276-022-03028-3

Keywords

Search

Navigation