{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:42Z","timestamp":1740142782175,"version":"3.37.3"},"reference-count":34,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2024,3,3]],"date-time":"2024-03-03T00:00:00Z","timestamp":1709424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"name":"Guangzhou Basic Research Program Jointly Funded"},{"name":"City and University","award":["202102010395"],"award-info":[{"award-number":["202102010395"]}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2021A1515011859"],"award-info":[{"award-number":["2021A1515011859"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176071"],"award-info":[{"award-number":["62176071"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Basic Research Program Municipal School (College) Joint Funding Project","award":["2023A03J0111"],"award-info":[{"award-number":["2023A03J0111"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,20]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Network function virtualization (NFV) has been proposed to enable flexible management and deployment of the network service in cloud. In NFV architecture, a network service needs to invoke several service functions (SFs) in a particular order following the service chain function. The placement of SFs has significant impact on the performance of network services. However, stochastic nature of the network service arrivals and departures as well as meeting the end-to-end Quality of Service(QoS) makes the SFs placement problem even more challenging. In this paper, we firstly provide a system architecture for the SFs placement of cloud service with end-to-end QoS deadline. We then formulate the end-to-end service placement as a Markov decision process (MDP) which aims to minimize the placement cost and the end-to-end delay. In our MDP, the end-to-end delay of active services in the network is considered to be the state of the system, and the placement (nonplacement or placement) of SF is considered as the action. Also, we discuss the rationality of our analytical model by analyzing the Markov stochastic property of the end-to-end service placement. To obtain the optimal placement policy, we then propose an algorithm (Algorithm 1) for dynamic SFs placement based on our model and use successive approximations, i.e. $\\epsilon $-iteration algorithm (Algorithm 2) to obtain action distribution. Finally, we evaluate the proposed MDP by comparing our optimal method with DDQP, DRL-QOR, MinPath and MinDelay for QoS optimization, including acceptance probability, average delay, resource utilization, load-balancing and reliability.<\/jats:p>","DOI":"10.1093\/comjnl\/bxae019","type":"journal-article","created":{"date-parts":[[2024,3,4]],"date-time":"2024-03-04T16:47:26Z","timestamp":1709570846000},"page":"2473-2485","source":"Crossref","is-referenced-by-count":0,"title":["Service Function Placement Optimization For Cloud Service With End-to-End Delay Constraints"],"prefix":"10.1093","volume":"67","author":[{"given":"Guofeng","family":"Yan","sequence":"first","affiliation":[{"name":"School of Computer Science and Cyber Engineering , Guangzhou University, Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengwen","family":"Su","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering , Guangzhou University, Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hengliang","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University , Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiao","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University , Guangzhou, 510006 , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,3,3]]},"reference":[{"volume-title":"Service Function Chaining (SFC) Architecture, RFC: 7665; Internet Engineering Task Force (IETF): Fremont","year":"2015","author":"Halpern","key":"2024072105012586200_ref1"},{"key":"2024072105012586200_ref2","doi-asserted-by":"crossref","DOI":"10.1109\/APNOMS.2014.6996545","article-title":"MORSA: A multi-objective resource scheduling algorithm for NFV infrastructure","volume-title":"Proc. 16th Asia-Pacific Netw. Oper. Manage. Symp. (APNOMS)","author":"Yoshida","year":"2014"},{"key":"2024072105012586200_ref3","article-title":"Problem statement for service function chaining","volume":"7498","author":"Quinn","year":"2015","journal-title":"RFC"},{"key":"2024072105012586200_ref4","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.ins.2019.11.015","article-title":"A congestion game framework for service chain composition in NFV with function benefit","volume":"514","author":"Le","year":"2020","journal-title":"Inf. Sci."},{"key":"2024072105012586200_ref5","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1109\/TNET.2018.2842798","article-title":"Deploying chains of virtual network functions: on the relation between link and server usage","volume":"26","author":"Kuo","year":"2018","journal-title":"IEEE\/ACM Trans. Netw"},{"key":"2024072105012586200_ref6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/TNSM.2021.3049298","article-title":"DDQP: A double deep Q-learning approach to online fault-tolerant SFC placement","volume":"18","author":"Wang","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"2024072105012586200_ref7","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1109\/TCC.2020.3020269","article-title":"A reliability-aware, delay guaranteed, and resource efficient placement of service function chains in Softwarized 5G networks","volume":"10","author":"Thiruvasagam","year":"2022","journal-title":"IEEE Trans. Cloud Comput."},{"key":"2024072105012586200_ref8","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/LCOMM.2022.3144692","article-title":"End-to-end congestion control to provide deterministic latency over internet","volume":"26","author":"Liu","year":"2022","journal-title":"IEEE Commun. Lett."},{"key":"2024072105012586200_ref9","doi-asserted-by":"crossref","DOI":"10.1109\/GLOCOM.2016.7842188","article-title":"QoS-aware VNF placement Optimization in Edge-Central Carrier Cloud Architecture","volume-title":"Proceedings of the 2016 IEEE International Conference on Global Communications Conference (GLOBECOM)","author":"Jemaa","year":"2016"},{"key":"2024072105012586200_ref10","first-page":"1","article-title":"VNF-FG design and VNF placement for 5G mobile networks","volume":"60","author":"Cao","year":"2017","journal-title":"Springer J. Inf. Sci."},{"key":"2024072105012586200_ref11","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1109\/TNSM.2017.2729506","article-title":"SDN-based traffic aware placement of NFV middleboxes","volume":"14","author":"Ma","year":"2017","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"2024072105012586200_ref12","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.ins.2017.08.021","article-title":"The cost-efficient deployment of replica servers in virtual content distribution networks for data fusion","volume":"432","author":"Sun","year":"2018","journal-title":"Inf. Sci."},{"key":"2024072105012586200_ref13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10922-022-09713-0","article-title":"A mobility-aware service function chain migration strategy based on deep reinforcement learning","volume":"31","author":"Hu","year":"2023","journal-title":"J. Netw. Syst. Manage."},{"key":"2024072105012586200_ref14","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2023.109563","article-title":"Service function chain migration with the long-term budget in dynamic networks","volume":"223","author":"Qin","year":"2023","journal-title":"Comput Netw"},{"key":"2024072105012586200_ref15","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/ICWS53863.2021.00062","article-title":"An Efficient Algorithm for Service Function Chains Reconfiguration in Mobile Edge Cloud Networks","volume-title":"2021 IEEE International Conference on Web Services (ICWS)","author":"Li","year":"2021"},{"key":"2024072105012586200_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ICC40277.2020.9149045","article-title":"Cloud-native Service Function Chaining for 5G based on Network Service Mesh","volume-title":"2020 IEEE International Conference on Communications (ICC)","author":"Dab","year":"2020"},{"key":"2024072105012586200_ref17","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TII.2022.3177415","article-title":"Service function chaining in industrial internet of things with edge intelligence: A natural actor-critic approach","volume":"19","author":"Li","year":"2023","journal-title":"IEEE Trans. Ind. Inf."},{"key":"2024072105012586200_ref18","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.comcom.2022.08.005","article-title":"End-to-end delay guaranteed service function chain deployment: A multi-level mapping approach","volume":"194","author":"Yaghoubpour","year":"2022","journal-title":"Comput Commun"},{"article-title":"The dynamic placement of virtual network functions, 2014 IEEE\/IFIP network operations and Management symposium (NOMS)","year":"2014","author":"Clayman","key":"2024072105012586200_ref19"},{"key":"2024072105012586200_ref20","article-title":"Optimal placement of service function in service function chaining","volume-title":"2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN)","author":"Ko","year":"2016"},{"key":"2024072105012586200_ref21","doi-asserted-by":"crossref","DOI":"10.1109\/CLOUD.2016.0028","article-title":"Online vnf scaling in datacenters","volume-title":"2016 IEEE 9th International Conference on Cloud Computing (CLOUD)","author":"Wang","year":"2016"},{"key":"2024072105012586200_ref22","first-page":"1","article-title":"Network functions virtualization with soft real-time guarantees","volume-title":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","author":"Li","year":"2016"},{"key":"2024072105012586200_ref23","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1109\/TNET.2017.2668470","article-title":"An approach for service function chain routing and virtual function network instance migration in network function virtualization architectures","volume":"25","author":"Eramo","year":"2017","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"2024072105012586200_ref24","doi-asserted-by":"crossref","first-page":"5188","DOI":"10.1109\/JSYST.2022.3154162","article-title":"Energy-aware hierarchical resource Management and backhaul traffic optimization in heterogeneous cellular networks","volume":"16","author":"Mohajer","year":"2022","journal-title":"IEEE Systems Journal"},{"key":"2024072105012586200_ref25","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/TSC.2022.3186099","article-title":"Heterogeneous computational resource allocation for NOMA: toward green mobile edge-Computing systems","volume":"16","author":"Mohajer","year":"2023","journal-title":"IEEE Trans. Serv. Comput."},{"key":"2024072105012586200_ref26","doi-asserted-by":"crossref","first-page":"3380","DOI":"10.1109\/TNSM.2023.3239417","article-title":"Energy-efficient hierarchical resource allocation in uplink-downlink decoupled NOMA HetNets","volume":"20","author":"Dong","year":"2023","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"2024072105012586200_ref27","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/TCC.2016.2525987","article-title":"Follow-me cloud: when cloud services follow mobile users","volume":"7","author":"Taleb","year":"2019","journal-title":"IEEE Trans. Cloud Comput."},{"key":"2024072105012586200_ref28","first-page":"1","article-title":"An efficient service function chaining placement algorithm in mobile edge Computing","volume":"20","author":"Wang","year":"2021","journal-title":"ACM Trans. Internet Technol."},{"key":"2024072105012586200_ref29","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/TNSM.2021.3051903","article-title":"Availability- and traffic-aware placement of parallelized SFC in data center networks","volume":"18","author":"Wang","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"2024072105012586200_ref30","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1109\/TNSM.2021.3055494","article-title":"DRL-QOR: deep reinforcement learning-based QoS\/QoE-aware adaptive online orchestration in NFV-enabled networks","volume":"18","author":"Chen","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"2024072105012586200_ref31","doi-asserted-by":"crossref","first-page":"6113","DOI":"10.1007\/s11227-020-03305-y","article-title":"A cost saving and load balancing task scheduling model for heterogeneous cloud datacenters","volume":"76","author":"Cai","year":"2020","journal-title":"J. Supercomput."},{"key":"2024072105012586200_ref32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ICC.2017.7996596","article-title":"Dynamic control of NFV forwarding graphs with end-to-end deadline constraints","volume-title":"2017 IEEE International Conference on Communications (ICC)","author":"Millnert","year":"2017"},{"key":"2024072105012586200_ref33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3713-0","volume-title":"Fundamentals of Queuing Systems","author":"Thomopoulos","year":"2012"},{"key":"2024072105012586200_ref34","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1109\/TNET.2005.852876","article-title":"NonConvex optimization and rate control for multi-class services in the internet","volume":"13","author":"Lee","year":"2005","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/7\/2473\/58602459\/bxae019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/7\/2473\/58602459\/bxae019.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T05:02:57Z","timestamp":1721538177000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/7\/2473\/7618464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,3]]},"references-count":34,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2024,3,3]]},"published-print":{"date-parts":[[2024,7,20]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxae019","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2024,7]]},"published":{"date-parts":[[2024,3,3]]}}}