Efficient algorithms for Web services selection with end-to-end QoS constraints
Efficient algorithms for Web services selection with end-to-end QoS constraints
复制标题
DOI：
10.1145/1232722.1232728
复制
发表时间：
2007-05
期刊：
影响因子：
--
通讯作者：
Tao Yu-;Yue Zhang;Kwei-Jay Lin
中科院分区：
文献类型：
--
作者：
Tao Yu-;Yue Zhang;Kwei-Jay Lin
面向服务的体系结构(Service-Oriented Architecture，SOA)为服务组合提供了灵活的框架。使用基于标准的协议(如SOAP和WSDL)，可以通过集成独立开发的原子服务来构建组合服务。根据一些应用相关的性能要求，需要算法来选择具有不同服务质量级别的服务组件。我们设计了一种基于代理的体系结构，以便于选择基于服务质量的服务。服务选择的目标是在端到端的服务质量约束下最大化特定于应用的效用函数。该问题的建模方法有两种：组合模型和图模型。组合模型将问题定义为多维多选择0-1背包问题(MMKP)。图模型将问题定义为多约束最优路径(MCOP)问题。针对不同组合结构的服务流程，提出了高效的启发式算法，并通过仿真研究了算法的性能。我们还比较了这两种模型的优缺点。
Service-Oriented Architecture (SOA) provides a flexible framework for service composition. Using standard-based protocols (such as SOAP and WSDL), composite services can be constructed by integrating atomic services developed independently. Algorithms are needed to select service components with various QoS levels according to some application-dependent performance requirements. We design a broker-based architecture to facilitate the selection of QoS-based services. The objective of service selection is to maximize an application-specific utility function under the end-to-end QoS constraints. The problem is modeled in two ways: the combinatorial model and the graph model. The combinatorial model defines the problem as a multidimension multichoice 0-1 knapsack problem (MMKP). The graph model defines the problem as a multiconstraint optimal path (MCOP) problem. Efficient heuristic algorithms for service processes of different composition structures are presented in this article and their performances are studied by simulations. We also compare the pros and cons between the two models.