{"title":"A Cost-Effective Hybrid Cloud Resource Scaling Framework for Batch Processing Services","authors":"Qinzhi Zhang;Li Pan;Shijun Liu","doi":"10.1109/TNSE.2024.3502503","DOIUrl":null,"url":null,"abstract":"Batch processing services, like offline video processing, are pivotal in modern data analysis. Software as a Service (SaaS) providers typically purchase virtual machines (VMs) or Function as a Service (FaaS) instances, also known as function instances, from cloud providers to provision computational resources for their services. VMs offer stable performance and cost-effectiveness for continuous workloads but may incur resource waste due to idleness. Conversely, function instances, with rapid auto-scaling and fine-grained billing, excel in handling discrete workloads, albeit at a higher unit price. SaaS providers can leverage the advantages of both VMs and function instances, to achieve cost-effective service delivery while ensuring overall performance. However, due to the complexity and unpredictability of batch processing service workloads, achieving this goal is challenging. To address these issues, in this paper we propose a proximal policy optimization (PPO) based hybrid resource scaling algorithm and design a hybrid resource scaling framework. The proposed scaling framework considers the workload characteristics and performance requirements of batch processing services, adaptively making cost-optimal resource scaling decisions based on current workloads and configuration of computational resources, while ensuring the overall performance of the service. We conduct extensive simulation experiments on multiple workloads with different levels of discreteness extracted from Microsoft and Huawei datasets, and the results demonstrate that our framework can achieve optimal service cost while ensuring overall performance.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 1","pages":"476-487"},"PeriodicalIF":6.7000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10757370/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Batch processing services, like offline video processing, are pivotal in modern data analysis. Software as a Service (SaaS) providers typically purchase virtual machines (VMs) or Function as a Service (FaaS) instances, also known as function instances, from cloud providers to provision computational resources for their services. VMs offer stable performance and cost-effectiveness for continuous workloads but may incur resource waste due to idleness. Conversely, function instances, with rapid auto-scaling and fine-grained billing, excel in handling discrete workloads, albeit at a higher unit price. SaaS providers can leverage the advantages of both VMs and function instances, to achieve cost-effective service delivery while ensuring overall performance. However, due to the complexity and unpredictability of batch processing service workloads, achieving this goal is challenging. To address these issues, in this paper we propose a proximal policy optimization (PPO) based hybrid resource scaling algorithm and design a hybrid resource scaling framework. The proposed scaling framework considers the workload characteristics and performance requirements of batch processing services, adaptively making cost-optimal resource scaling decisions based on current workloads and configuration of computational resources, while ensuring the overall performance of the service. We conduct extensive simulation experiments on multiple workloads with different levels of discreteness extracted from Microsoft and Huawei datasets, and the results demonstrate that our framework can achieve optimal service cost while ensuring overall performance.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.