Skip to main content

A QoS-Based Service Chain Composition Approach for a Dynamic End-to-End Resource Allocation in NFV

  • Conference paper
  • First Online:
Advanced Information Networking and Applications (AINA 2020)

Abstract

Resource allocation is one of the main challenges that have to be addressed before the Network Function Virtualizaton (NFV) concept matures. It consists of three coordinated steps namely chaining, mapping and scheduling. Actually, many studies have addressed the mapping and scheduling steps, while assuming the chaining stage is performed, which is as important as the two others. In this paper, we address the chaining phase in a dynamic environment. We model the service composition problem as a multi-constrained path selection problem. The objective is to minimize the chaining decision time, also known as service composition time. We afterward propose QASCH, a two-stage QoS-Aware Service Chain Composition Heuristic, to solve it. Simulation results show that our approach performs better than that of two other approaches, namely CoordVNF and TS-SFCC in terms of time composition and acceptance ratio when the number of services being chained increases.

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
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Y.Sup41: ITU-T Y.2200-series - Deployment models of service function chaining (2016). https://www.itu.int/rec/T-REC-Y.Sup41/en

  2. Alleg, A., Ahmed, T., Mosbah, M., Riggio, R., Boutaba, R.: Delay-aware VNF placement and chaining based on a flexible resource allocation approach. In: 2017 13th International Conference on Network and Service Management (CNSM), pp. 1–7 (2017). https://doi.org/10.23919/CNSM.2017.8255993

  3. Beck, M.T., Botero, J.F.: Coordinated allocation of service function chains. In: 2015 IEEE Global Communications Conference (GLOBECOM), pp. 1–6 (2015). https://doi.org/10.1109/GLOCOM.2015.7417401

  4. Beck, M.T., Linnhoff-Popien, C., Fischer, A., Kokot, F., de Meer, H.: A simulation framework for virtual network embedding algorithms. In: 2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks), pp. 1–6 (2014). https://doi.org/10.1109/NETWKS.2014.6959238. ISSN: null

  5. Bhamare, D., Jain, R., Samaka, M., Erbad, A.: A survey on service function chaining. J. Netw. Comput. Appl. 75, 138–155 (2016). https://doi.org/10.1016/j.jnca.2016.09.001. http://www.sciencedirect.com/science/article/pii/S1084804516301989

    Article  Google Scholar 

  6. Gil-Herrera, J., Botero, J.F.: A scalable metaheuristic for service function chain composition. In: 2017 IEEE 9th Latin-American Conference on Communications (LATINCOM), pp. 1–6 (2017). https://doi.org/10.1109/LATINCOM.2017.8240194

  7. Kim, T., Kim, S., Lee, K., Park, S.: A QoS assured network service chaining algorithm in network function virtualization architecture. In: 2015 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, pp. 1221–1224 (2015). https://doi.org/10.1109/CCGrid.2015.135

  8. Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: Proceedings of IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), vol. 2, pp. 834–843 (2001). https://doi.org/10.1109/INFCOM.2001.916274, ISSN 0743-166X

  9. Mehraghdam, S., Keller, M., Karl, H.: Specifying and placing chains of virtual network functions. In: 2014 IEEE 3rd International Conference on Cloud Networking (CloudNet), pp. 7–13 (2014). https://doi.org/10.1109/CloudNet.2014.6968961

  10. Wang, M., Bo, C., Biyi, L.: Service function chain composition and mapping in NFV-enabled networks. In: IEEE Conference Publication (2019). https://doi.org/10.1109/SERVICES.2019.00092. https://ieeexplore.ieee.org/document/8817212

  11. Wang, P., Lan, J., Zhang, X., Hu, Y., Chen, S.: Dynamic function composition for network service chain: model and optimization. Comput. Netw. 92, 408–418 (2015). https://doi.org/10.1016/j.comnet.2015.07.020. http://www.sciencedirect.com/science/article/pii/S1389128615003266

    Article  Google Scholar 

  12. Wu, Y., Peng, G., Wang, H., Zhang, H.: A heuristic algorithm for optimal service composition in complex manufacturing networks (2019). https://doi.org/10.1155/2019/7819523. https://www.hindawi.com/journals/complexity/2019/7819523/

  13. Yi, B., Wang, X., Li, K., Das, S.K., Huang, M.: A comprehensive survey of network function virtualization. Comput. Netw. 133, 212–262 (2018). https://doi.org/10.1016/j.comnet.2018.01.021. https://linkinghub.elsevier.com/retrieve/pii/S1389128618300306

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Inès Raïssa Djouela Kamgang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Djouela Kamgang, I.R., Zhioua, G.E.M., Tabbane, N. (2020). A QoS-Based Service Chain Composition Approach for a Dynamic End-to-End Resource Allocation in NFV. In: Barolli, L., Amato, F., Moscato, F., Enokido, T., Takizawa, M. (eds) Advanced Information Networking and Applications. AINA 2020. Advances in Intelligent Systems and Computing, vol 1151. Springer, Cham. https://doi.org/10.1007/978-3-030-44041-1_13

Download citation

Publish with us

Policies and ethics