Abstract: This paper proposes a routing algorithm for composed service. Routing tragedies as LDT and LDT-P algorithms are designed to fit the line and parallel structure composition respectively. Composition agent is responsible for searching components and generating a least delay tree. The processing ability of the nodes and the bandwith of links are considered comprehensively while selecting a path for composed service. Simulation shows that LDT and LDT-P algorithms have the feature of higher composition success rate and shorter path length, compared with the currently routing algorithms.

Key words: service composition, routing, QoS, load balancing, overlay network

摘要： 提出了一种满足QoS约束的组合服务路由算法，分别对线性和并行2种服务组合情况设计了路由算法LDT和LDT-P。由组合代理节点搜索功能组件并生成最小延迟树，综合考虑节点的处理能力、链路带宽，采用层次图法来决定组合服务的路由。实验结果表明与其他算法相比，LDT和LDT-P具有较高的服务组合成功率和较短的路径长度。

关键词: 服务组合, 路由, 服务质量, 负载均衡, 覆盖网络

CLC Number: 

• TP393