| 面向复杂业务的组合服务方案选择算法 |
| |
| 引用本文： | 张艳梅,余镇危,曹怀虎. 面向复杂业务的组合服务方案选择算法[J]. 计算机工程, 2009, 35(18): 75-77 |
| |
| 作者姓名： | 张艳梅 余镇危 曹怀虎 |
| |
| 作者单位： | 中国矿业大学机电与信息工程学院,北京,100083;中央财经大学信息学院,北京,100081;中国矿业大学机电与信息工程学院,北京,100083;中央财经大学信息学院,北京,100081 |
| |
| 摘 要： | 针对串行或并行的组合服务路由算法不适用于电子商务等业务中的复杂服务组合关系问题，提出多回合组合服务的服务发现方法及组合方案的选择算法，服务发现时，将延迟最小作为首要考虑因素，选择组合策略时，将服务组件间的交互次数量化为路径选择的一项度量指标。仿真实验结粜表明，对于多交互的复杂服务组合路径选择问题，提出的算法在性能上优于以往的服务组合路由算法。
|
| 关 键 词： | 服务组合 服务发现 服务覆盖网络 复杂业务 |
| 修稿时间： | |
Complicated-business-oriented Selection Algorithm of Composed Service Scheme |
| |
| ZHANG Yan-mei,YU Zhen-wei,CAO Huai-hu. Complicated-business-oriented Selection Algorithm of Composed Service Scheme[J]. Computer Engineering, 2009, 35(18): 75-77 |
| |
| Authors: | ZHANG Yan-mei YU Zhen-wei CAO Huai-hu |
| |
| Affiliation: | 1.School of Mechanical Electronic & Information Engineering;China University of Mining and Technology;Beijing 100083;2.School of Information;Central University of Finance and Economics;Beijing 100081 |
| |
| Abstract: | Previous routing algorithms designed for the linear and parallel service composition are not feasible since there are multiple interactive messages between service components.This paper proposes a feasible selection algorithm of composed service scheme to solve the problem, in which delay is a prior consideration while finding service component, and the interactive message times is regarded as an important metric while choosing a composed service scheme.Simulation result shows that compared with other algor... |
| |
| Keywords: | service composition service discovery Service Overlay Network(SON) complicated business |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
