| Web服务组合的马氏策略规划 |
| |
| 引用本文： | 曾伟,胡垚.Web服务组合的马氏策略规划[J].计算机工程与科学,2009,31(3). |
| |
| 作者姓名： | 曾伟 胡垚 |
| |
| 作者单位： | 华中科技大学系统工程研究所,湖北,武汉,430074 |
| |
| 基金项目： | 图像信息处理与智能控制教育重点实验室开放基金 |
| |
| 摘 要： | 针对Web服务存在的业务逻辑与服务质量的不确定性,以及时序、时间窗约束,本文提出了利用马尔可夫决策理论来解决Web服务组合中最优策略规划问题的方法。该方法首先将Web服务组合描述为有向无环图表示的任务网络,网络中每个节点代表一个任务。任务是由相应的Web服务来实现,任务之间的弧线代表任务间时序的约束,任务执行应满足时间窗的约束。在此基础上,建立Web服务组合的马尔可夫决策模型,从而获得Web服务组合的最优策略。
|
| 关 键 词： | Web服务组合 马尔可夫决策过程 时间窗 策略规划 |
Policy Planning of the Web Services Composition Based on the Markov Decision Process |
| |
| ZENG Wei,HU Yao.Policy Planning of the Web Services Composition Based on the Markov Decision Process[J].Computer Engineering & Science,2009,31(3). |
| |
| Authors: | ZENG Wei HU Yao |
| |
| Affiliation: | Institute of Systems Engineering;Huazhong University of Science and Technology;Wuhan 430074;China |
| |
| Abstract: | To deal with the non-deterministics of business logic and the QoS of Web Services,temporal and time window constraints,the Markov decision process(MDP) is proposed to solve the optimal policy planning problem of Web services composition(WSC).Web services invocation is regarded as an acyclic directed graph,named task network.In the graph,each node stands for a task,and it is realized by the corresponding Web services.Edges in the graph represent temporal constraints.Each task has a duration and its execution... |
| |
| Keywords: | Web services composition Markov decision process time window policy planning |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
