摘要
为了动态地把现存的各种Web服务整合起来,形成新的、满足不同用户需求的、增值的复杂服务,提出了一种支持服务质量全局最优和动态重计划的Web服务组合算法。该算法使用位置矩阵编码方式表示所有组合路径和重计划信息。通过计算个体间服务质量的海明距离,提高了服务组合的质量;通过指定用户总时间限制和实施优良解保留策略,解决了算法运行时间对服务质量的影响问题。与同类成果相比,该算法提供了一种在动态环境下更完整和有效的服务组合的服务质量解决方案。实验结果证明了算法的可行性和有效性。
To dynamically integrate the existing Web services to form a newly value-added and complex service to meet the requirements for different users, a Web services composition algorithm supporting Global Optimal and Dynamic Re-Planning（GODRP） of Quality of Service （QoS） was presented. A position matrix coding scheme was used to express simultaneously all of composite paths and re-planning information in the algorithm. The quality of the services composition was improved by means of calculating Hamming Distance of QoS among individuals. It was solved that the algorithm＇s execution time impair the QoS by prescribing a total time limit and implementing a fine solutions reservation strategy. Compared to similar studies, this algorithm provided a more integrated and effective QoS scheme of services composition in dynamic environment. Experimental results indicated the feasibility and effectiveness of this algorithm.
出处
《计算机集成制造系统》
EI
CSCD
北大核心
2008年第10期2068-2075,共8页
Computer Integrated Manufacturing Systems
基金
国家科技支撑计划资助项目(2007BAH08B04)
国家863计划资助项目(2006AA102233)
国家博士点基金资助项目(20050611027)~~
关键词
WEB服务组合
服务质量
位置矩阵
重计划
遗传算法
Web services composition
quality of service
position matrix
re planning
genetic algorithm
