摘要： 针对串行或并行的组合服务路由算法不适用于电子商务等业务中的复杂服务组合关系问题，提出多回合组合服务的服务发现方法及组合方案的选择算法，服务发现时，将延迟最小作为首要考虑因素，选择组合策略时，将服务组件间的交互次数量化为路径选择的一项度量指标。仿真实验结果表明，对于多交互的复杂服务组合路径选择问题，提出的算法在性能上优于以往的服务组合路由算法。

关键词: 服务组合, 服务发现, 服务覆盖网络, 复杂业务

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 algorithms, the proposed algorithms achieve better performance.

Key words: service composition, service discovery, Service Overlay Network(SON), complicated business

中图分类号: 

• TP393