Makespan and Security-Aware Workflow Scheduling for Cloud Service Cost Minimization

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Cloud Computing Pub Date : 2024-03-27 DOI:10.1109/TCC.2024.3382351
Liying Li;Chengliang Zhou;Peijin Cong;Yufan Shen;Junlong Zhou;Tongquan Wei
{"title":"Makespan and Security-Aware Workflow Scheduling for Cloud Service Cost Minimization","authors":"Liying Li;Chengliang Zhou;Peijin Cong;Yufan Shen;Junlong Zhou;Tongquan Wei","doi":"10.1109/TCC.2024.3382351","DOIUrl":null,"url":null,"abstract":"The market penetration of Infrastructure-as-a-Service (IaaS) in cloud computing is increasing benefiting from its flexibility and scalability. One of the most important issues for IaaS cloud service providers is to minimize the monetary cost while meeting cloud user experience requirements such as makespan and security. Prior works on cloud service cost minimization ignore either security or makespan which is very important for user experience. In this article, we propose a two-stage algorithm to solve the cloud service cost minimization problem at the premise of satisfying the security and makespan requirements of cloud users. Specifically, in the first stage, we propose a novel security service selection scheme to ensure system security by judiciously selecting security services with low cost for tasks under the constraints of time and security. In the second stage, to further reduce the cloud service cost, we design a workflow scheduling method based on an improved firefly algorithm (IFA). The IFA-based method schedules cloud service workflows to virtual machines of small cost at the premise of guaranteeing security and makespan. It can quickly find the workflow scheduling solution with minimized cost using our designed updating scheme and mapping operator. Extensive simulations are conducted on real-world workflows to verify the efficacy of the proposed two-stage method. Simulation results show that the proposed two-stage method outperforms the baseline and two benchmarking methods in terms of cost minimization without violating security and time constraints. Compared to benchmarking methods, the cloud service cost can be reduced by up to 57.6% by using our proposed approach.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"12 2","pages":"609-624"},"PeriodicalIF":5.3000,"publicationDate":"2024-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10480637/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The market penetration of Infrastructure-as-a-Service (IaaS) in cloud computing is increasing benefiting from its flexibility and scalability. One of the most important issues for IaaS cloud service providers is to minimize the monetary cost while meeting cloud user experience requirements such as makespan and security. Prior works on cloud service cost minimization ignore either security or makespan which is very important for user experience. In this article, we propose a two-stage algorithm to solve the cloud service cost minimization problem at the premise of satisfying the security and makespan requirements of cloud users. Specifically, in the first stage, we propose a novel security service selection scheme to ensure system security by judiciously selecting security services with low cost for tasks under the constraints of time and security. In the second stage, to further reduce the cloud service cost, we design a workflow scheduling method based on an improved firefly algorithm (IFA). The IFA-based method schedules cloud service workflows to virtual machines of small cost at the premise of guaranteeing security and makespan. It can quickly find the workflow scheduling solution with minimized cost using our designed updating scheme and mapping operator. Extensive simulations are conducted on real-world workflows to verify the efficacy of the proposed two-stage method. Simulation results show that the proposed two-stage method outperforms the baseline and two benchmarking methods in terms of cost minimization without violating security and time constraints. Compared to benchmarking methods, the cloud service cost can be reduced by up to 57.6% by using our proposed approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最小化云服务成本的工时和安全意识工作流调度
基础设施即服务(IaaS)的灵活性和可扩展性使其在云计算领域的市场渗透率不断提高。对于 IaaS 云服务提供商来说,最重要的问题之一是在满足云用户体验要求(如正常运行时间和安全性)的同时最大限度地降低货币成本。之前关于云服务成本最小化的研究忽略了安全性或正常运行时间,而正常运行时间对用户体验非常重要。在本文中,我们提出了一种两阶段算法,在满足云用户安全性和时延要求的前提下解决云服务成本最小化问题。具体来说,在第一阶段,我们提出了一种新颖的安全服务选择方案,在时间和安全的约束下,为任务明智地选择成本低的安全服务,以确保系统安全。在第二阶段,为了进一步降低云服务成本,我们设计了一种基于改进萤火虫算法(IFA)的工作流调度方法。基于 IFA 的方法在保证安全和有效期的前提下,将云服务工作流调度到成本较小的虚拟机上。利用我们设计的更新方案和映射算子,它能快速找到成本最小的工作流调度方案。我们在实际工作流中进行了大量仿真,以验证所提出的两阶段方法的有效性。仿真结果表明,在不违反安全性和时间限制的前提下,所提出的两阶段方法在成本最小化方面优于基准方法和两种基准方法。与基准方法相比,使用我们提出的方法,云服务成本最多可降低 57.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
期刊最新文献
COCSN: A Multi-Tiered Cascaded Optical Circuit Switching Network for Data Center Aggregate Monitoring for Geo-Distributed Kubernetes Cluster Federations Group Formation and Sampling in Group-Based Hierarchical Federated Learning HEXO: Offloading Long-Running Compute- and Memory-Intensive Workloads on Low-Cost, Low-Power Embedded Systems Joint Offloading and Resource Allocation for Collaborative Cloud Computing With Dependent Subtask Scheduling on Multi-Core Server
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1