中文摘要：

如何在大规模的Web服务集合中进行快速、高效的自动组合是当前Web服务组合研究与应用的难点.传统的Web服务自动组合方法大多建立在单机计算基础上,服务数量一旦过多,规划或搜索空间随之膨胀,组合效率低下.本文提出了一种分步分治、深度优先搜索的Top-k Qos服务组合算法,并采用MapReduce实现了分布式、并行的服务自动组合过程.实验结果表明,该方法在应对大规模的服务集合时,能快速、高效的提供满足用户需求的组合服务.

英文摘要：

How to compose services automatically and efficiently is a difficult issue, especially for a large number of ser- vices. Traditional methods based on single-computation usually come to inefficiency due to the explosion of the planning and search- ing space when the number of services grows too much. Based on the MapReduce framework, this paper proposes an automatic ser- vice composition method based on depth-first searching for the Top-k Qos service composition issue. The result from a serial of ex- periments indicates that the method can satisfy composition requirements quickly and efficiently even with a large-scale service repository.