摘要： 提出了面向服务组合的覆盖服务网络(OSN)的设计方法。从节点放置和链路选择两方面考虑OSN的设计问题。给出了覆盖节点的放置模型，分别用不同算法求解。实验结果表明，Lagrangian松弛算法在寻优能力上高于贪婪算法和随机算法。用实验模拟了不同链路选择策略对OSN路由性能的影响，结果说明邻接连接拓扑结构的故障恢复率高、路由开销小，适合作为OSN的拓扑结构。

关键词: 服务组合, 覆盖服务网络, 节点放置, 拓扑结构

Abstract: A design method of overlay service network is proposed, which includes two subproblems. A node placement model is presented and three kinds of algorithms are simulated, among which the Lagrangian relaxation algorithm is the best in finding out the optimal result. Simulation is made to show the impact of different link selection strategy on OSN routing performance, the result indicts that adjacent connection topology has high failure recovery rate and low routing overhead, so it can be selected as OSN’s topology.

Key words: service composition, overlay service network(OSN), node placement, topology structure

中图分类号: 

• TP393