• 论文 •    

基于不确定服务质量的Web服务选择算法

祝希路,王柏   

  1. 北京邮电大学 北京市智能通信软件与多媒体重点实验室,北京100876
  • 出版日期:2011-11-15 发布日期:2011-11-25

Web service selection algorithm based on uncertain quality of service

ZHU Xi-lu, WANG Bai   

  1. Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia, Beijing University of Posts and Telecommunication, Beijing 100876, China
  • Online:2011-11-15 Published:2011-11-25

摘要: 针对开放环境中Web服务的动态性和随机性问题,提出了一种基于不确定服务质量的Web服务选择算法。算法中服务质量的不确定性主要用概率区间描述,包括概率区间的置信上界、下界和均值三个指标。通过置信上界、下界与均值的偏差,可以计算出Web服务受动态环境影响的程度。因此,最优组合服务的选择可采用均值的加权和最大以及偏差最小来度量。将动态环境下服务选择问题转化为带不确定QoS约束的单目标组合优化问题,通过基于社团划分思想的遗传算法,加速算法收敛并找出满足最优条件的组合服务。仿真实验表明,该算法能有效克服不确定因素对服务选择的影响,提高服务选择的效率,保证选择的正确性。

关键词: Web服务选择, 不确定QoS, 概率区间, 约束优化, 遗传算法

Abstract: To deal with the dynamic and stochastic characteristics of Web service in open environment, a Web service selection algorithm based on uncertain Quality of Service (QoS) was proposed. The uncertainty of QoS was described by probability interval, including confidence upper bound, lower bound and the mean value. By using the difference between the mean value and the two bounds, the influence of dynamic environment on Web service was calculated. Thus, the selection of optimum Composite Web Service (CWS) could be evaluated with the maximum weighted sum of mean and the minimum difference. The Web service selection problem under dynamic environment was transformed into single-target combinatorial optimization problem with uncertain QoS constraints. Through the Genetic Algorithm (GA) based on the community partition, the algorithm convergence was speeded and the service composition which satisfied the optimum conditions was obtained. The experimental results showed that the proposed algorithm could overcome the effect of uncertain factors on Web service selection, and the selection efficiency was improved as well as the selection was ensured.

Key words: Web service selection, uncertain quality of service, probability interval, constraint optimization, genetic algorithms

中图分类号: