基于服务QoS执行信息的Web服务推荐研究

基于服务的非功能（QoS）特性进行服务发现是面向服务计算领域的一个研究热点。为了克服服务QoS难以获取且动态变化的特点,提出一种基于已往QoS执行信息的Web服务推荐方法。首先给出一种可以方便记录QoS执行信息的系统框架;然后描述了基于时间加权的服务推荐的匹配算法;实验结果表明该推荐方法是可行和有效的。     

Web服务组合执行引擎中服务代理运行机制研究

在Web服务组合执行引擎WebJetFlow中解耦流程执行和成分Web服务调用,将服务代理的服务调用由同步模式转变为单纯异步模式,并用NS2模拟器针对服务代理的同步模式转变为单纯异步模式,以及有服务代理和无服务代理的两种不同的引擎处理机制分别进行模拟仿真。仿真结果证明：在同样的线程资源条件下,有服务代理的引擎访问流量大于无服务代理引擎;解耦流程执行和成分Web服务调用以及单纯异步调用模式提高了引擎资源的使用效率、增加了流程执行的并发性、改善了引擎的吞吐量和性能。     

Web services: problems and future directions

Recently, Web services have generated great interests in both vendors and researchers. Web services, based on existing Internet protocols and open standards, can provide a flexible solution to the problem of application integration. With the help of WSDL, SOAP, and UDDI, Web services are becoming popular in Web applications. However, the current Web services architectures are confronted with a few stubborn problems, for instance, security. In this paper, we shall give an overview of these problems. We believe that solving these problems will become crucial to success of Web services. In the end, we predict distinct advances in semantic Grid services.     

Web服务组合执行引擎中服务异步调用机制研究*

研究了BPEL4WS执行引擎WebJetFlow对Web服务的异步调用机制,在引擎的服务调用代理中对Web服务统一采用非阻塞双传输异步调用,提高了调用线程的利用率。同时引入了cache机制并设计了相应的cache替换算法,保证了引擎对异步调用结果消息的匹配效率以及数据安全性, 通过实验验证引擎的性能有了明显的提高。     

基于三层组织模型的一种Web服务组合策略

在研究Web服务三层组织模型和有限状态自动机的基础上,提出了一种新的Web服务组合策略,给出了一个服务的可组合性定理,并证明了定理的正确性。该策略以Web服务三层组织模型为基础,简化了BPEL中基于有限状态自动机的Web服务自动组合,精简了服务组合流程。最后对这种新的组合策略的优缺点作了分析。     

基于QoS的Web服务选择算法综述*

服务选择算法是影响组合服务的QoS和服务组合性能高低的关键因素。针对近几年来基于QoS的Web服务选择算法的发展状况进行了综述,介绍和总结了当前基于QoS的Web服务选择问题模型,对服务选择策略进行了分类,并对当前的一些典型的基于QoS的Web服务选择算法进行了系统的分析和评论。最后指出了现有算法中的不足之处,展望了该领域的进一步研究方向。     

基于语义的Web服务自动发现、匹配及执行平台

基于UDDI技术的普遍的Web服务发现、匹配、执行平台有可能产生严重的效率及服务响应延迟问题，文中介绍了一个限定于特定领域的Web服务自动发现、匹配及执行系统以试图解决此问题，同时给出了一个基于OWL-S本体语言的系统实现。在服务选择过程中实现了地域匹配功能，并为服务请求代理提供了一个初步的行为记忆功能。     

基于动态QoS的Web服务组合

在Web服务组合中,现行的几种QoS衡量标准都将重点放在单个Web服务本身的质量上,而忽视了Web服务动态特性、组合特性以及服务组合中的网络特性。另外,在诸多服务组合的算法中,都只是强调组合服务的总体质量,却忽略了用户对某些质量属性的约束条件,从而导致服务重计算问题经常发生。为此,考虑了服务动态特性以及服务间的协作关系对组合服务质量的影响,提出了动态QoS模型;同时,综合了用户的质量约束以及组合服务的整体质量,将用户的质量约束引入服务组合流程中。最后通过实验证实了所提出的动态QoS模型能够根据服务实体的实时情况计算服务质量,同时将用户的质量约束引入服务组合流程中,有效地避免了服务重计算问题。     

Web服务组合中基于 QoS的改进型遗传算法 *

提出了一种在 Web服务组合中基于 QoS的改进型遗传算法。该算法通过计算个体间服务质量的海明距离提高了服务组合的质量 ;通过指定用户总时间限制和实施优良解保留策略解决了算法运行时间对服务质量的影响问题。实验结果表明了算法的有效性。     

Efficient execution of composite Web services exchanging intensional data

Web service technologies provide a standard means of integrating heterogeneous applications distributed over the Internet. Successive compositions of new Web services using pre-existing ones usually create a hierarchical structure of invocations among a large number of Web services. For the efficient execution of these composite Web services, we propose an approach which exploits intensional XML data, i.e. an XML document that contains special elements representing the calls to Web services, in order to delegate the invocations of the external Web services to some relevant nodes. We formalize an invocation plan for composite Web services in which intensional data is used as their parameters and results, and define a cost-based optimization problem to obtain an efficient invocation plan for them. We provide an A∗ heuristic search algorithm to find an optimal invocation plan for a given set of Web services and also present a greedy method of generating an efficient solution in a short time. The experimental results show that the proposed greedy method can find a close-to-optimal solution efficiently and has good scalability for a complex call hierarchy of Web services.     

Web服务相容性的形式化描述与分析

Web服务的相容性分析是为了保证多个Web服务之间的正确交互。基于Pi-演算对Web服务的相容性进行了形式化的分析,给出了二个Web服务之间相容性的两个形式化定义。同时定义了二个Web服务进程之间的投影操作,在此基础上给出了多个Web服务之间相容性的形式化定义。     

一种基于Web服务的工作流过程模型

工作流管理系统实施是提高企业核心竞争力的有力措施,而工作流过程模型是整个工作流管理系统的基础,在Web服务的基础上提出了一种分层的过程模型,同时在过程模型中增加新的元素事务活动和事务节点,增加了模型对工作流管理系统的分布异构环境以及事务特性的支持.     

基于历史用户QoS感知的Web服务发现方法

目前的Web服务发现方法,由于没有充分利用用户情境信息,导致在服务发现时间和结果准确率方面存在不足。首先对包括当前用户在内的情境相似的用户进行了聚类,缩小了服务发现的范围;然后,在此基础上利用当前用户偏好信息及情境相似的历史用户感知到的候选服务的QoS数据,给出了一种基于历史用户QoS感知的Web服务发现方法,包括候选服务的QoS数据获取和综合权重计算;最后,结合实验并与其他Web服务发现方法进行比较,证明了该方法在服务发现结果的准确率和时间效率方面均有了一定的提升。     

基于图的Web服务组合的研究

从Web服务质量入手,将QoS参数属性作为图的权重,提出了基于图的Web服务组合建模,并介绍了用不同的算法分别在模型上寻找解决方案.     

基于语义向量模型的Web服务匹配方法*

针对当前Web服务匹配方法中存在的缺陷,将语义Web服务匹配方法与信息检索技术相结合,提出一种利用语义相似度扩展向量模型的Web服务匹配方法,并通过实验对匹配效果进行了检验与分析。实验结果证明,与基于经典向量模型的匹配方法和相关语义匹配方法相比,该匹配方法具有更高的准确率。     

An efficient composition of Web services with active network support

Composition of Web services enables collaboration among autonomous business organisations such that they can integrate their services to perform collaborative business activities. It facilitates the development of new services using pre-existing Web services thus reducing development and operational costs. However, the highly distributed, dynamic, and autonomous nature of component Web services gives rise to various issues such as service matchmaking, reliability, availability, security and efficiency. This paper presents a new protocol in order to improve the efficiency of Web services composition. The proposed protocol is based on the peer-to-peer paradigm which exploits the capabilities of underlying networks such that part of the processing is carried out at the network nodes. Efficiency of the proposed protocol is tested through various experiments. Experimental results show that the proposed protocol significantly improves performance by reducing the system response time in the composition of Web services.     

A framework for ensuring consistency of Web Services Transactions

For efficiently managing Web Services (WS) transactions which are executed across multiple loosely-coupled autonomous organizations, isolation is commonly relaxed. A Web service operation of a transaction releases locks on its resources once its jobs are completed without waiting for the completions of other operations. However, those early unlocked resources can be seen by other transactions, which can spoil data integrity and cause incorrect outcomes. Existing WS transaction standards do not consider this problem. In this paper, we propose a mechanism to ensure the consistent executions of isolation-relaxing WS transactions. The mechanism effectively detects inconsistent states of transactions with a notion of an end-state dependency and recovers them to consistent states. We also propose a new Web services Transaction Dependency management Protocol (WTDP). WTDP helps organizations manage the WS transactions easily without data inconsistency. WTDP is designed to be compliant with a representative WS transaction standard, the Web Services Transactions specifications, for easy integration into existing WS transaction systems. We prototyped a WTDP-based WS transaction management system to validate our protocol.     

基于BTM主题模型的Web服务聚类方法研究

针对网络中海量的Web服务聚类时,因其表征数据稀疏而导致使用传统建模方法所获效果不理想的问题,提出了一种基于BTM主题模型的Web服务聚类方法。该方法首先利用BTM学习整个Web服务描述文档集的隐含主题,通过推理得出每篇文档的主题分布,然后应用K Means算法对Web服务进行聚类。通过与LDA、TF IDF等方法进行对比发现,该方法在聚类纯度、熵和F Measure指标上均具有更好的效果。实验表明,该方法能够有效解决因Web服务描述所具有的短文本性质而导致的数据稀疏性问题,可显著提高服务聚类效果。     

An automatic subdigraph renovation plan for failure recovery of composite semantic Web services

A Web service-based system never fulfills a user＇s goal unless a failure recovery approach exists. It is inevitable that several Web services may either perish or fail before or during transactions. The completion of a composite process relies on the smooth execution of all constituent Web services. A mediator acts as an intermediary between providers and consumers to monitor the execution of these services. If a service fails, the mediator has to recover the whole composite process or else jeopardize achieving the intended goals. The atomic replacement of a perished Web service usually does not apply because the process of locating a matched Web service is unreliable. Even the system cannot depend on the replacement of the dead service with a com- posite service. In this paper, we propose an automatic renova- tion plan for failure recovery of composite semantic services based on an approach of subdigraph replacement. A replacement subdigraph is posed in lieu of an original subdigraph, which includes the failed service. The replacement is done in two separate phases, ofltine and online, to make the recovery faster. The ofitine phase foresees all possible subdigraphs, pre-calculates them, and ranks several possible replacements. The online phase compensates the unwanted effects and executes the replacement subdigraph in lieu of the original subdigraph. We have evaluated our approach during an experiment and have found that we could recover more than half of the simulated failures. These achievements show a significant improvement compared to current approaches     

An automatic subdigraph renovation plan for failure recovery of composite semantic Web services

A Web service-based system never fulfills a user’s goal unless a failure recovery approach exists. It is inevitable that several Web services may either perish or fail before or during transactions. The completion of a composite process relies on the smooth execution of all constituent Web services. A mediator acts as an intermediary between providers and consumers to monitor the execution of these services. If a service fails, the mediator has to recover the whole composite process or else jeopardize achieving the intended goals. The atomic replacement of a perished Web service usually does not apply because the process of locating a matched Web service is unreliable. Even the system cannot depend on the replacement of the dead service with a composite service. In this paper, we propose an automatic renovation plan for failure recovery of composite semantic services based on an approach of subdigraph replacement. A replacement subdigraph is posed in lieu of an original subdigraph, which includes the failed service. The replacement is done in two separate phases, offline and online, to make the recovery faster. The offline phase foresees all possible subdigraphs, pre-calculates them, and ranks several possible replacements. The online phase compensates the unwanted effects and executes the replacement subdigraph in lieu of the original subdigraph. We have evaluated our approach during an experiment and have found that we could recover more than half of the simulated failures. These achievements show a significant improvement compared to current approaches.