云计算环境下带安全约束的工作流调度问题的研究

J4 ›› 2014, Vol. 36 ›› Issue (04): 607-614.

云计算环境下带安全约束的工作流调度问题的研究

马俊波，殷建平

（国防科学技术大学计算机学院，湖南长沙 410073）

收稿日期:2013-09-20 修回日期:2013-12-05 出版日期:2014-04-25 发布日期:2014-04-25
基金资助:
国家自然科学基金资助项目(61232016，61170287，60970034)

Security-constrained workflow scheduling
in cloud computing environments

MA Junbo,YIN Jianping

(College of Computer,National University of Defense Technology,Changsha 410073,China)

Received:2013-09-20 Revised:2013-12-05 Online:2014-04-25 Published:2014-04-25

摘要/Abstract

摘要：

资源调度问题一直是云计算环境下的热点研究问题，然而当前的大部分研究都集中在满足用户的时间或成本需求上，很少考虑用户在调度过程中对安全的需求。针对这一问题，在对常见的云环境下工作流任务的资源调度问题进行建模的基础上，提出了一个安全约束模型，并使用变近邻粒子群算法对该问题进行了求解。最后在CloudSim仿真平台上，用最大最小蚁群算法和遗传算法与该算法进行了对比，实验结果表明，该算法具有很好的可用性和寻优能力。关键词：

关键词: 云计算, 资源调度, 工作流, 安全约束, 变邻域粒子群算法

Abstract:

Workflow scheduling is one of the critical problems in cloud environment. Lots of strategies are presented to solve it. However, most of them only care about satisfying the time and cost QoS requirements of the users, such as the deadlines of the tasks, and cannot guarantee the security of scheduling. But the security is one of the most concerned issues for the cloud users. To solve this problem, a security constraint model for workflow scheduling problem is presented. Based on it, the Variable Neighborhood Particle Swarm Optimization(VNPSO) is adapted and implemented as the scheduling algorithm. Two representative metaheuristic based scheduling algorithms including MaxMin Ant Colony Optimization (MMACO) and Genetic algorithm (GA) are also implemented as the candidate scheduling algorithms. CloudSim is set up as the simulation platform, and the simulation experiments show that the variable neighborhood search heuristic provides a good balance between global exploration and local exploitation and makes VNPSO feasible and effective for scheduling workflow tasks.

Key words: cloud computing;resource scheduling;workflow;security constraints;VNPSO

马俊波，殷建平. 云计算环境下带安全约束的工作流调度问题的研究[J]. J4, 2014, 36(04): 607-614.

MA Junbo,YIN Jianping. Security-constrained workflow scheduling
in cloud computing environments [J]. J4, 2014, 36(04): 607-614.

参考文献

［1］Mell P, Grance T. The NIST definition of cloud computing (draft)［S］. NIST Special Publication 800145, 2011.
［2］Abrishami S, Naghibzadeh M, Epema D H J. Deadlineconstrained workflow scheduling algorithms for infrastructure as a service clouds［J］. Future Generation Computer Systems, 2013, 29(1):158169.
［3］Liu K,Jin H,Chen J,et al.A compromisedtimecost scheduling algorithm in swindewc for instanceintensive costconstrained workflows on a cloud computing platform［J］. International Journal of High Performance Computing Applications, 2010, 24(4):445456.
［4］Rao J,Wei Y,Gong J,et al.QoS guarantees and service differentiation for dynamic cloud applications［J］. IEEE Transactions on Network and Service Management, 2013, 10(1):4355.
［5］Wu Z,Liu X,Ni Z,et al.A marketoriented hierarchical scheduling strategy in cloud workflow systems［J］. The Journal of Supercomputing, 2013, 63(1):256293.
［6］Ergu D,Kou G,Peng Y,et al.The analytic hierarchy process:Task scheduling and resource allocation in cloud computing environment［J］. The Journal of Supercomputing, 2013,64(3):114.
［7］Hamlen K, Kantarcioglu M, Khan L, et al. Security issues for cloud computing［J］. International Journal of Information Security and Privacy (IJISP), 2010, 4(2):3648.
［8］Song S, Hwang K, Kwok Y K. Riskresilient heuristics and genetic algorithms for securityassured grid job scheduling［J］. IEEE Transactions on Computers, 2006, 55(6):703719.
［9］Kennedy J, Eberhart R. Particle swarm optimization［C］∥Proc of IEEE International Conference on Neural Networks, 1995:19421948.
［10］Shi Y, Eberhart R C. Parameter selection in particle swarm optimization［C］∥Proc of the 7th International Conference on Evolutionary Programming VII, 1998:591600.
［11］Hansen P, Mladenovic N. Variable neighborhood search:Principles and applications［J］. European Journal of Operational Research, 2001, 130(3):449467.
［12］Liu H, Abraham A, Choi O, et al. Variable neighborhood particle swarm optimization for multiobjective flexible jobshop scheduling problems［C］∥Proc of the 6th International Conference on Simulated Evolution and Learning, 2006:197204.
［13］Garg S K, Buyya R. NetworkCloudSim:Modelling parallel applications in cloud simulations［C］∥Proc of the 4th IEEE International Conference on Utility and Cloud Computing(UCC), 2011:105113.
［14］Pitakaso R, Almeder C, Doerner K F, et al. A MAXMIN ant system for unconstrained multilevel lotsizing problems［J］. Computers & Operations Research, 2007, 34(9):25332552.
［15］Omara F A, Arafa M M. Genetic algorithms for task scheduling problem［J］. Journal of Parallel and Distributed Computing, 2010, 70(1):1322.

[1]	李卫平1,2，武海燕2，杨杰1. 基于效益博弈的云计算资源动态可协调分配策略研究[J]. J4, 20160101, 38(01): 57-61.
[2]	杨柏蔼, 赵山, 刘芳. 无服务器计算技术研究综述[J]. 计算机工程与科学, 2022, 44(04): 611-619.
[3]	李波, 侯鹏, 牛力, 武浩, 丁洪伟. 基于软件定义网络的云边协同架构研究综述[J]. 计算机工程与科学, 2021, 43(02): 242-257.
[4]	廖建锦, 孙庆骁, 杨海龙, 栾钟治, 钱德沛. 满足工作流执行时限的可抢占虚拟机实例配置和调度方法研究[J]. 计算机工程与科学, 2020, 42(11): 1956-1964.
[5]	林涛, 冯竞凯, 郝章肖, 黄少群. 基于组合预测模型的云计算资源负载预测研究[J]. 计算机工程与科学, 2020, 42(07): 1168-1173.
[6]	周碧莹1，王爱平1，费长江2，虞万荣2，赵宝康2. 基于强化学习的卫星网络资源调度机制[J]. 计算机工程与科学, 2019, 41(12): 2134-2142.
[7]	史文杰，詹雨奇，李奎. 一种面向多平台航电资源建模及其调度算法[J]. 计算机工程与科学, 2019, 41(11): 1976-1984.
[8]	刘梓璇，周建涛. 负载均衡的主导资源公平分配算法[J]. 计算机工程与科学, 2019, 41(09): 1574-1580.
[9]	王宇新，王飞，王冠，郭禾. 一种基于两级DAG模型的MapReduce工作流异构调度算法[J]. 计算机工程与科学, 2019, 41(08): 1353-1359.
[10]	曹云梦1,2,周胜军3,刘晨1,2,韩燕波1,2. 面向服务的云-端动态协作方法[J]. 计算机工程与科学, 2019, 41(04): 598-605.
[11]	郭宏乐，陈旺虎，马生俊，李新田，乔保民. 一种云环境下科学工作流执行计划的优化方法[J]. 计算机工程与科学, 2019, 41(03): 433-439.
[12]	李进生，蒙江，童名文. 基于分布式遗传算法的水质传感器布置优化研究[J]. 计算机工程与科学, 2019, 41(03): 545-550.
[13]	罗裕春,武继刚,史雯隽,贺子楠. 移动云计算中的任务调度与计算迁移算法[J]. 计算机工程与科学, 2018, 40(11): 1915-1924.
[14]	齐平1,2,王福成1,王必晴1,梁昌勇2. 云计算环境下基于可靠性感知的任务调度算法[J]. 计算机工程与科学, 2018, 40(11): 1925-1935.
[15]	郑红，叶成，邓文轩. 基于工作流网的游戏作弊检测系统建模[J]. 计算机工程与科学, 2018, 40(11): 2092-2096.