| 摘要: |
| 随着执行时绑定的Web 服务的提出及其被大量地应用到开放式服务中,用户对支持快速和动态的Web 服务组合提出了新的要求.即在组合过程中,用尽可能短的时间花费选择满足用户端到端的QoS 要求的服务.针对要求,提出了一种基于全局QoS 约束分解的动态服务选择方法(Web service dynamic selection approach,简称WSDSA).该方法的主要思想是,通过基于模糊逻辑的自适应调整方法(adaptive adjustment method,简称AAM)和应粒子群优化算法(adaptive particle swarm optimization,简称APSO)将全局QoS 约束自适应地分解为满足用户的局部约束,然后利用局部最优获得最合适的组合服务.性能评价表明,WSDSA 方法具有较好的有效性,仅用较时间花费就能达到或接近全局最优解,能够满足服务选择的实时性和动态性. |
| 关键词: 服务选择 服务组合 QoS 粒子群优化算法 模糊逻辑 |
| DOI：10.3724/SP.J.1001.2011.03842 |
| 分类号: |
| 基金项目:国家自然科学基金(60821001); 国家重点基础研究发展计划(973)(2009CB320406, 2009CB320504); 国家高技术研
究发展计划(863)(2008AA01A317) |
|
| Web Service Dynamic Selection by the Decomposition of Global QoS Constraints |
|
WANG Shang-Guang, SUN Qi-Bo, YANG Fang-Chun
|
|
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876,
China
|
| Abstract: |
| With the growing number of alternative Web services in the open Web service environment, users have
put forward new demands that bind the runtime of Web services, which requires as much short computation time as
possible to satisfy user’s end-to-end QoS requirements service composition. Therefore, this paper proposes a Web
service dynamic selection approach, based on the decomposition of global QoS constraints, WSDSA (Web service
dynamic selection approach). The WSDSA uses as adaptive adjustment method (AAM), based on fuzzy logic and
adaptive particle swarm optimization algorithm (APSO), to adaptively decompose global QoS constrains to local
constraints with the user’s preferences, and then WSDSA can obtain the most appropriate composition service with
local selection. Performance evaluations show WSDSA is very effective, and is able to reach optimal or near
optimal results with a very low time cost, which satisfies the real time and dynamic service selection. |
| Key words: service selection service composition QoS particle swarm optimization algorithm fuzzy logic |
