支持QoS保障的可信服务组合调度算法  

Dependable Service Composition Scheduling Algorithm for QoS Guarantee

作　　者：马林[1,2] 朱明[1,3] 王雷[1,3] 王嵩[1,3] 

机构地区：[1]中国科学技术大学网络传播系统与控制安徽省重点实验室,合肥230027 [2]中国科学技术大学电子工程与信息科学系,合肥230027 [3]中国科学技术大学自动化系,合肥230027

出　　处：《小型微型计算机系统》2013年第2期193-198,共6页Journal of Chinese Computer Systems

基　　金：国家科技支撑计划项目(2008BAH28B04)资助;国家自然科学基金项目(60975045)资助

摘　　要：随着分布式服务组合技术的迅速发展和广泛应用,大多数服务组合调度算法仅考虑性能QoS,已难以满足应用需要,服务实例可能是带有不确定性或恶意性的,对整个服务组合QoS性能有较大的影响.提出一种支持QoS保障的可信服务组合调度算法,该算法首先利用Dempster-Shafer理论、Shapley熵和Pignistic概率转换理论,提出一种服务实例的可信评估模型,然后利用此评估结果对传统服务组合调度算法进行改进得到该可信算法.仿真实验结果证实该可信算法可以有效地提高服务组合调度的成功率和QoS性能.With rapid development and wide application of the distributed service composition technology, the service composition scheduling algorithms which only consider functional QoS are difficult to meet the needs of applications. Service instances may have uncertainty or malicious behavior, and it will cause the bad performance of the whole process. This paper proposes a dependable serv- ice composition scheduling algorithm for QoS guarantee. Firstly a trust evaluation model of service instances is proposed by using the Dempster-Shafer theory, Shapley entropy and the theory of Pignistic probability transforms, and then we get the new dependable algo- rithm by using this model to improve the traditional service composition scheduling algorithms. The experiment results show that the new dependable algorithm can effectively improve the success rate of scheduling and the performance of QoS metrics.

关 键 词：服务组合 调度 Dempster—Shafer理论 可信评估模型 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]