Skip to main content
SpringerLink
Log in

Minimizing the Embedding Cost of Service Function Chains with Adjustable Order

  • Conference paper
  • First Online:
Wireless Sensor Networks (CWSN 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1715))

Included in the following conference series:

Abstract

Network Function Virtualization (NFV) has becoming an emerging technology for ensuring the reliability and security of data flows. The virtual network function (VNF) embedding problem, which tries to minimize the embedding cost has attracted extensive interests recently. However, the existing works always assume the fixed execution order of VNFs, which limits their application. Thus, we investigate the VNF embedding problem without such limitations in this paper. Firstly, a general transformation framework is proposed for the NFV-enabled unicast routing with adjustable order. Then, an optimal algorithm is proposed for the unicast VNF embedding without delay constraints. Additionally, an efficient algorithm is also proposed for such problem with delay constraints. Finally, we evaluate the proposed algorithms via numerical results, which show that our algorithms significantly outperform the existing benchmarks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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. Afolabi, I., Taleb, T., Samdanis, K., Ksentini, A., Flinck, H.: Network slicing and softwarization: a survey on principles, enabling technologies, and solutions. IEEE Commun. Surv. Tutor. 20(3), 2429–2453 (2018)

    Article  Google Scholar 

  2. Yao, B., Gao, H., Chen, Q., Li, J.: Energy-adaptive and bottleneck-aware many-to-many communication scheduling for battery-free wsns. IEEE Internet Things J. 8(10), 8514–8529 (2021)

    Article  Google Scholar 

  3. Chen, Q., Cai, Z., Cheng, L., Gao, H., Li, J.: Structure-free broadcast scheduling for duty-cycled multihop wireless sensor networks. IEEE Trans. Mob. Comput. 21, 4624–4641 (2021)

    Article  Google Scholar 

  4. Feng, H., Llorca, J., Tulino, A.M., Raz, D., Molisch, A.F.: Approximation algorithms for the NFV service distribution problem. In: IEEE INFOCOM 2017-IEEE Conference on Computer Communications, pp. 1–9. IEEE (2017)

    Google Scholar 

  5. Bremler-Barr, A., Harchol, Y., Hay., D.: Openbox: a software-defined framework for developing, deploying, and managing network functions. In: Proceedings of the 2016 ACM SIGCOMM Conference, pp. 511–524 (2016)

    Google Scholar 

  6. Kuo, J.-J., Shen, S.-H., Kang, H.-Y., Yang, D.-N., Tsai, M.-J., Chen, W.-T.: Service chain embedding with maximum flow in software defined network and application to the next-generation cellular network architecture. In: IEEE INFOCOM 2017-IEEE Conference on Computer Communications, pp. 1–9. IEEE (2017)

    Google Scholar 

  7. Chen, Y., Wu, J.: NFV middlebox placement with balanced set-up cost and bandwidth consumption. In: Proceedings of the 47th International Conference on Parallel Processing, pp. 1–10 (2018)

    Google Scholar 

  8. Ma, Yu., Liang, W., Zichuan, X., Guo, S.: Profit maximization for admitting requests with network function services in distributed clouds. IEEE Trans. Parallel Distrib. Syst. 30(5), 1143–1157 (2018)

    Article  Google Scholar 

  9. Mirjalily, G., Asgarian, M., Luo, Z.-Q.: Interference-aware NFV-enabled multicast service in resource-constrained wireless mesh networks. IEEE Trans. Netw. Serv. Manage. 19(1), 424–436 (2021)

    Article  Google Scholar 

  10. Jia, M., Liang, W., Huang, M., Zichuan, X., Ma, Yu.: Routing cost minimization and throughput maximization of NFV-enabled unicasting in software-defined networks. IEEE Trans. Netw. Serv. Manage. 15(2), 732–745 (2018)

    Article  Google Scholar 

  11. Ren, B., Guo, D., Tang, G., Lin, X., Qin, Y.: Optimal service function tree embedding for nfv enabled multicast. In: 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 132–142. IEEE (2018)

    Google Scholar 

  12. Ren, B., Guo, D., Shen, Y., Tang, G., Lin, X.: Embedding service function tree with minimum cost for NFV-enabled multicast. IEEE J. Sel. Areas Commun. 37(5), 1085–1097 (2019)

    Article  Google Scholar 

  13. Alhussein, O., et al.: A virtual network customization framework for multicast services in NFV-enabled core networks. IEEE J. Sel. Areas Commun. 38(6), 1025–1039 (2020)

    Article  Google Scholar 

  14. Zhang, Q., Xiao, Y., Liu, F., Lui, J.C.S., Guo, J., Wang, T.: Joint optimization of chain placement and request scheduling for network function virtualization. In: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pp. 731–741. IEEE (2017)

    Google Scholar 

  15. Kuo, T.-W., Liou, B.-H., Lin, K.C.-J., Tsai, M.-J.: Deploying chains of virtual network functions: On the relation between link and server usage. IEEE/ACM Trans. Network. 26(4), 1562–1576 (2018)

    Article  Google Scholar 

  16. Jin, P., Fei, X., Zhang, Q., Liu, F., Li, B.: Latency-aware VNF chain deployment with efficient resource reuse at network edge. In: IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pp. 267–276. IEEE (2020)

    Google Scholar 

  17. Li, Y., Phan, L.T.X., Loo, B.T.: Network functions virtualization with soft real-time guarantees. In: IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications, pp. 1–9. IEEE (2016)

    Google Scholar 

  18. Ren, H., et al.: Efficient algorithms for delay-aware NFV-enabled multicasting in mobile edge clouds with resource sharing. IEEE Trans. Parallel Distribut. Syst. 31(9), 2050–2066 (2020)

    Article  Google Scholar 

  19. Zichuan, X., Liang, W., Jia, M., Huang, M., Mao, G.: Task offloading with network function requirements in a mobile edge-cloud network. IEEE Trans. Mob. Comput. 18(11), 2672–2685 (2018)

    Google Scholar 

  20. Yue, Y., Cheng, B., Li, B., Wang, M., Liu, X.: Throughput optimization VNF placement for mapping SFC requests in mec-nfv enabled networks. In: Proceedings of the 26th Annual International Conference on Mobile Computing and Networking, pp. 1–3 (2020)

    Google Scholar 

  21. Asgarian, M., Mirjalily, G., Luo, Z.-Q.: Trade-off between efficiency and complexity in multi-stage embedding of multicast VNF service chains. IEEE Commun. Lett. 26(2), 429–433 (2021)

    Article  Google Scholar 

  22. Gharbaoui, M., Contoli, C., Davoli, G., Borsatti, D., Cuffaro, G., Paganelli, F., Cerroni, W., Cappanera, P., Martini, B.: An experimental study on latency-aware and self-adaptive service chaining orchestration in distributed NFV and SDN infrastructures. Comput. Netw. 208, 108880 (2022)

    Article  Google Scholar 

  23. Kumazaki, M., Ogura, M., Tachibana, T.: Dynamic service chain construction based on model predictive control in NFV environments. IEICE Trans. Commun. 105(4), 399–410 (2022)

    Article  Google Scholar 

  24. Pei, J., Hong, P., Xue, K., Li, D.: Resource aware routing for service function chains in SDN and NFV-enabled network. IEEE Trans. Serv. Comput. 14(4), 985–997 (2018)

    Article  Google Scholar 

  25. Chen, Q., Gao, H., Li, Y., Cheng, S., Li, J.: Edge-based beaconing schedule in duty-cycled multihop wireless networks. In IEEE INFOCOM 2017-IEEE Conference on Computer Communications, pp. 1–9. IEEE (2017)

    Google Scholar 

  26. Chen, Q., Gao, H., Cheng, L., Li, Y.: Label coloring based beaconing schedule in duty-cycled multihop wireless networks. IEEE Trans. Mob. Comput. 19(5), 1123–1137 (2019)

    Article  Google Scholar 

  27. Juttner, A., Szviatovski, B., Mécs, I., Rajkó, Z.: 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. IEEE (2001)

    Google Scholar 

  28. Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE J. Sel. Areas Commun. 14(7), 1228–1234 (1996)

    Article  Google Scholar 

  29. Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)

    Article  Google Scholar 

  30. Chen, Q., Cai, Z., Cheng, L., Gao, H., Li, J.: Low-latency concurrent broadcast scheduling in duty-cycled multihop wireless networks. In: 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), pp. 851–860. IEEE (2019)

    Google Scholar 

  31. Chen, Q., Gao, H., Cheng, S., Fang, X., Cai, Z., Li, J.: Centralized and distributed delay-bounded scheduling algorithms for multicast in duty-cycled wireless sensor networks. IEEE/ACM Trans. Networking 25(6), 3573–3586 (2017)

    Article  Google Scholar 

  32. Book, R.V., Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of \( np \)-completeness. Bulletin (New Series) Am. Math. Soc. 3(2), 898–904 (1980)

    Article  Google Scholar 

  33. Salama, H.F., Reeves, D.S., Viniotis, Y.: A distributed algorithm for delay-constrained unicast routing. In: Proceedings of INFOCOM 1997, vol. 1, pp. 84–91. IEEE (1997)

    Google Scholar 

  34. Xu, Z., Liang, W., Huang, M., Jia, M., Guo, S., Galis, A.: Approximation and online algorithms for NFV-enabled multicasting in SDNs. In: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), pp. 625–634. IEEE (2017)

    Google Scholar 

  35. Brown, G., Analyst, S., Reading, H.: Service chaining in carrier networks, White paper (2015)

    Google Scholar 

  36. Luizelli, M.C., Raz, D., Sa’ar, Y.: Optimizing NFV chain deployment through minimizing the cost of virtual switching. In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications, pp. 2150–2158. IEEE (2018)

    Google Scholar 

  37. Huang, M., Liang, W., Xu, Z., Jia, M., Guo, S.: Throughput maximization in software-defined networks with consolidated middleboxes. In: 2016 IEEE 41st Conference on Local Computer Networks (LCN), pp. 298–306. IEEE (2016)

    Google Scholar 

Download references

Acknowledgement

This work was partly supported by the R &D projects in key areas of Guangdong Province (2020B010164001), the Key Program of NSFC- Guangdong Joints Funds (U1801263, .U2001201), the Projects of Science and Technology Plan of Guangdong province under Grant NOs. 2022A1515011032, 2020A1515011132, GDNRC[2020]024, the industry university research innovation fund of Chinese Universities (2021FNA02010), and the Guangdong Provincial Key Laboratory of Cyber-Physical System under Grant NOs. 2020B1212060069.

Author information

Authors and Affiliations

  1. School of Computers, Guangdong University of Technology, Guangzhou, 510006, China

    Pengxin Zheng, Quan Chen, Longqu Li & Lianglun Cheng

  2. School of Information Engineering, Guangdong University of Technology, Guangzhou, 510006, China

    Feng Wang

Authors
  1. Pengxin Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Longqu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lianglun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Quan Chen or Feng Wang .

Editor information

Editors and Affiliations

  1. Beijing University of Posts and Telecommunications, Beijing, China

    Huadong Ma

  2. Tsinghua University, Beijing, China

    Xue Wang

  3. Guangdong University of Technology, Guangzhou, China

    Lianglun Cheng

  4. Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    Li Cui

  5. Beijing University of Posts and Telecommunications, Beijing, China

    Liang Liu

  6. Guangdong University of Technology, Guangzhou, China

    An Zeng

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zheng, P., Chen, Q., Wang, F., Li, L., Cheng, L. (2022). Minimizing the Embedding Cost of Service Function Chains with Adjustable Order. In: Ma, H., Wang, X., Cheng, L., Cui, L., Liu, L., Zeng, A. (eds) Wireless Sensor Networks. CWSN 2022. Communications in Computer and Information Science, vol 1715. Springer, Singapore. https://doi.org/10.1007/978-981-19-8350-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-8350-4_14

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-8349-8

  • Online ISBN: 978-981-19-8350-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation