arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.1309cs.DC
收藏

服务选择的回溯算法

Backtracking algorithms for service selection

Yanik Ngoko, Christophe Cérin, Alfredo Goldman, Dejan Milojicic

摘要:

在本文中,我们将探讨服务组合的自动化。我们专注于服务选择问题。在我们考虑的公式中,问题的输入由行为组合构成,其抽象服务必须绑定到具体服务。目标是找到在某些服务级别协议下优化组合的{ \it实用程序}的绑定。我们提出了一个完整的解决方案。首先,我们表明,服务选择问题可以映射到一个约束满足问题(CSP)。这种映射的好处是,在解决CSP的大诀窍可以用于服务选择问题。在现有的解决CSP的技术,我们考虑回溯。我们的第二个贡献是提出各种基于回溯的算法的服务选择问题。所提出的变体的灵感来自于CSP的现有化学方法。我们分析了我们的框架的运行时增益在一个直观的决议的基础上详尽的搜索。我们的最后一个贡献是一个实验评估,我们证明,有一个有效的增益使用回溯,而不是一些可比的方法。实验还表明,我们的建议可以用于实时的发现,中小型服务的组合的最佳解决方案。

英文摘要:

In this paper, we explore the automation of services' compositions. We focus on the service selection problem. In the formulation that we consider, the problem's inputs are constituted by a behavioral composition whose abstract services must be bound to concrete ones. The objective is to find the binding that optimizes the {\it utility} of the composition under some services level agreements. We propose a complete solution. Firstly, we show that the service selection problem can be mapped onto a Constraint Satisfaction Problem (CSP). The benefit of this mapping is that the large know-how in the resolution of the CSP can be used for the service selection problem. Among the existing techniques for solving CSP, we consider the backtracking. Our second contribution is to propose various backtracking-based algorithms for the service selection problem. The proposed variants are inspired by existing heuristics for the CSP. We analyze the runtime gain of our framework over an intuitive resolution based on exhaustive search. Our last contribution is an experimental evaluation in which we demonstrate that there is an effective gain in using backtracking instead of some comparable approaches. The experiments also show that our proposal can be used for finding in real time, optimal solutions on small and medium services' compositions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑