# Popularity-Aware Service Provisioning Framework in Cloud Environment
## 6 Conclusions  
This paper designed a popularity-aware service provisioning framework (PASPF), in which a service provider inquires about the popularity variant of services by sending a request to NWDAF. The analytics were then used to decide appropriate the amount of resources requested to the cloud operator for the following billing cycle. To minimize the service provider's OPEX while keeping the average response time of the services below their requirements, a CMDP was formulated. By transforming the CMDP model into an LP model, the optimal stochastic policy was achieved. The evaluation results show that, compared to a popularity-non-aware scheme, the PASPF can save over 50% OPEX on service provider costs while guaranteeing sufficiently low average response times. In our future work, the proposed framework will be extended to consider the dynamicity of the network status, such as bandwidth and congestion, in order to analyze the impact of the dynamicity on performance. Conceptualization, H.K. ; methodology, H.K. ; software, Y.K. ([PERSON]) and B.K. ; validation, H.K. and Y.K. ([PERSON]); formal analysis, H.K. ; investigation, Y.K. ([PERSON]); writing--original draft preparation, H.K. and Y.K. ([PERSON]); supervision, Y.K. ([PERSON]). All authors have read and agreed to the published version of the manuscript. This research was supported by the National Research Foundation (NRF) of Korea Grant funded in part by the Korean Government (MSIP) (No. RS-2024-00340698) and in part by a grant from Kyung Hee University in 2023 (KHU-20233236). Not applicable. The raw data supporting the conclusions of this article will be made available by the authors on request. The authors declare no conflicts of interest. Figure 7: Effect of the maximum queue length on the average service response time. * [PERSON] et al. (2019) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] iDiSC: A New Approach to IoT-Data-Intensive Service Components Deployment in Edge-Cloud-Hybrid System. _IEEE Access_**2019**, \(7\), 59172-59184. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Optimal Application Deployment in Mobile Edge Computing Environment. In Proceedings of the IEEE 13 th International Conference on Cloud Computing (CLOUD), Beijing, China, 19-23 October 2020. * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Cooperative Edge Caching with Location-Based and Popular Contents for Vehicular Networks. _IEEE Trans. Veh. Technol._**2020**, _69_, 10291-10305. [CrossRef]
* [PERSON] et al. (2018) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Composition-Driven IoT Service Provisioning in Distributed Edges. _IEEE Access_**2018**, \(6\), 54258-54269. [CrossRef]
* [PERSON] et al. (2021) [PERSON]; [PERSON]; [PERSON]; [PERSON] MobiEdge: Mobile Service Provisioning for Edge Clouds with Time-varying Service Demands. In Proceedings of the IEEE 27 th International Conference on Parallel and Distributed Systems (ICPADS), Beijing, China, 14-16 December 2021. * (17)3 GPP TS 23.288; Architecture Enhancements for 5G System (5 GS) to Support Network Data Analytics Services (Release 18). 3 GPP: France, Paris, 2024. * IP Network Traffic Flows Labeled with 75 Apps. Available online: [[https://www.kaggle.com/code/kernel/starter-ip-network-traffic-flows-49778383-1/notebook](https://www.kaggle.com/code/kernel/starter-ip-network-traffic-flows-49778383-1/notebook)]([https://www.kaggle.com/code/kernel/starter-ip-network-traffic-flows-49778383-1/notebook](https://www.kaggle.com/code/kernel/starter-ip-network-traffic-flows-49778383-1/notebook)) (accessed on 10 July 2024). * [PERSON] et al. (2022) [PERSON]; [PERSON]; [PERSON] An Optimal Battery Charging Algorithm in Electric Vehicle-Assisted Battery Swapping Environments. _IEEE Trans. Intell. Transp. Syst._**2022**, _23_, 3985-3994. [CrossRef]
* [PERSON] and [PERSON] (2023) [PERSON]; [PERSON] Function-Aware Resource Management Framework for Serverless Edge Computing. _IEEE Internet Things J._**2023**, _10_, 1310-1319.