Semantic web service composition testbed

A huge amount of web services are deployed on the Web, nowadays. These services can be used to fulfill online requests. Requests are getting more and more complicated over time. So, there exists a lot of frequent request that cannot be fulfilled using just one web service. For using web services, composing individual services to create the added-value composite web service to fulfill the user request is necessary in most cases. Web services can be composed manually but it is a too tedious and time consuming task. The ability of automatic web service composition to create a new composite web service is one of the key enabling features for the future for the semantic web. There are some successful methods for automatic web service composition, but the lack of standard, open, and lightweight test environment makes the comparison and evaluation of these composition methods impossible. In this paper we propose an architecture for a light weight and scalable testbed to execute, test and evaluate automatic web service composition algorithms. The architecture provides mandatory components for implementing and evaluation of automatic web service composition algorithms. Also, this architecture provides some extension mechanisms to extend its default functionalities. We have also given reference implementations for web service matchmaking and composition. Also, some scenarios for testing and evaluating the testbed are given. We have found that the performance of the composition method will dramatically decrease as the number of web services increases.     

一种基于Agent与分布式缓存的服务组合体系结构

基于UDDI技术的普遍的Web服务发现、匹配、执行平台有可能产生严重的速率及服务响应延迟问题,本文提出了一种基于multi-agent与分布式缓存技术的服务组合的体系结构,分布式缓存可以提供一种高效的搜索方式,进而比较安全、快速的满足用户请求。文章的最后探讨了Web服务组合的发展趋势以及有待于进一步要做的工作。     

Planning and monitoring the execution of web service requests

Interaction with web services enabled marketplaces would be greatly facilitated if users were given a high level service request language to express their goals in complex business domains. This can be achieved by using a planning framework which monitors the execution of planned goals against predefined standard business processes and interacts with the user to achieve goal satisfaction. We present a planning architecture that accepts high level requests, expressed in a service request language known as XSRL. The planning framework is based on the principle of interleaving planning and execution. This is accomplished on the basis of refinement and revision as new service-related information is gathered from service repositories such as UDDI and web services instances, and as execution circumstances necessitate change. The planning system interacts with the user whenever confirmation or verification is needed.     

用BPMN辅助整合Web Services

介绍了用BPMN设计整合Web Service,并产生Web Service描述语言(WSDL)形式的可执行规范语言,以及利用WSDL可以转换成业务流程管理标识(BPMN)的方法,动态地将已存在的Web Service通过BPMN图形化建模方法进行整合.鉴于BPMN的图形化设计,可以选择喜欢的可执行语言来实现该整合方案,主要采用与BPMN密切关联的Web Service语言--面向服务的业务流程可执行语言(BPEL4WS).     

基于客户行为模式的Web文档预送

预送作为主动cache,是cache机制由时间局部性向空间局部性的拓展.文章提出服务器主动预送的两种模式.基于单个URL的模式利用客户请求的马尔可夫链特征获取文档的时序相关模型,可进行多级预送.基于会话的模式包括基于文档属性和会话整体语义的途径,重点研究基于文档属性的途径,给出基本的聚集算法,探讨了文档兴趣的定量表达,提出反映访问时序的属性向量距离算法.对于预送性能的度量,给出请求命中率、会话命中率、预送效率和预送代价等度量方法.同时,完成大量实验,对客户行为分析的这两种模式进行比较.文章提出的由服务器访     

基于深度优先的分步分治算法研究

Top-k服务组合问题对于学术界和工业界来讲,都有实际的研究意义和应用场景。文中分析了理解top-k问题的关键所在解图,提出了基于深度优先的分步分治算法进行服务组合。该算法对用户请求的输出参数分别进行求解,该过程可并行处理,在求解结束后再进行合并。该方法可以支持分布式、并行处理框架,从而在应对大规模的服务集合时,能快速、高效地提供满足用户需求的组合服务;提出了通过构造解图的方法进行搜索求解,通过求解＂关键路径＂和＂非关键路径＂与合并＂关键路径＂和＂非关键路径＂得到解图。     

基于扩展语义接口的Web服务动态组合方法

自动地根据用户请求进行服务的动态组合是目前Web服务领域的关键问题.针对该问题,提出了一种基于本体的服 务动态组合方法,设计并实现了一个服务动态组合原型.首先Web服务按照一定规则被抽象为本体模型,然后通过分析所 构造服务的模型来实现服务的匹配,最后利用BPEL4ws对匹配生成的服务组合序列来进行自动的组合.实验结果表明,该 方法细化了服务接口的语义,并且在发现结果上有更高的准确性.     

Friendly web services selection exploiting fuzzy formal concept analysis

This work describes a system for supporting the user in the discovery of semantic web services, taking into account personal requirements and preference. Goal is to model an ad-hoc service request by selecting conceptual terms rather than using strict syntax formats. Through a concept-based navigation mechanism indeed, the user discovers conceptual terminology associated to the web resources and uses it to generate an appropriate service request which syntactical matches the names of input/output specifications. The approach exploits the fuzzy formal concept analysis for modeling concepts and relative relationships elicited from web resources. After the request formulation and submission, the system returns the list of semantic web services that match the user query.     

Web服务器集群系统QoWS研究

请求负载的增加常常导致Web服务器系统性能降低,用户期望的服务质量得不到保证,这是服务级Web系统所面临和必须解决的问题。文章提出了一种Web服务器集群环境下的负载分配策略,通过对用户请求分类、将不同类别的请求进行响应性能隔离、优先为高级别请求提供服务以及请求许可控制等手段,对不同类别的Web请求提供不同质量的服务,保证了服务级用户的服务质量。同时采用最迟分配原则,改善系统的负载均衡能力,缩短系统平均响应时间。最后通过仿真实验,验证了该策略的正确性和有效性。     

QoS-Aware Composite Services Retrieval

For current service-oriented applications, individual web service usually cannot meet the requirements arising from real world applications, so it is necessary to combine the functionalities of different web services to obtain a composite service in response to users＇ service requests. In order to address the problem of web service composition, this paper proposes an efficient approach to composing basic services in case no any individual service can fully satisfy users＇ requests. Compared with the general strategies adopted in most previously proposed approaches where only the best composition solution is produced, the QoS-aware service composition approach is given and top k solutions in the framework are provided, rather than focusing on obtaining the best composition solution, since the presented approach allows more candidates that are likely to meet the requirements of the users. The approach is based on a succinct binary tree data structure, and a system,named ATC （Approach to Top-k Composite services retrieval） system is implemented. In ATC, Qos is taken into account for composite service, and a heuristic-based search method is proposed to retrieve top k composite service. Some extensive experiments are designed and two web service benchmarks are used for performance study. The experimental results snow that the proposed approach can assure high precision and efficiency for composite service search.     

Multi-Objective Optimization Model for QoS-Enabled Web Service Selection in Service-Based Systems

Nowadays, the web service has become the emerging communication technology where the interaction of each user is performed through the World Wide Web. However, the performance of the web service mechanism is degraded due to security flaws that occur throughout the Internet.. The user or service requester may not attain the relevant web service for their requirement. To overcome this problem, the newly developed multi-objective based Cuckoo Search (MCS) algorithm is proposed in this article. Initially, the input query model was built by the query keyword that is provided by the service requester. Then, the given query is matched with the database that hosts the web services that relates to input query. Among the various services, the user has to select the appropriate web service using the proposed algorithm. The MCS algorithm is newly designed by combining the Cuckoo Search algorithm and the QoS parameter based multiple objectives. Additionally, the new mathematical model of fitness is evaluated by the multi-objective parameters. Finally, the proposed algorithm exploits the fitness value to select the relevant web service for the user query. The experimental results are validated and performance is analyzed by the parameters of precision, recall, and F-measure. Thus, 86.6% of precision value was obtained by the proposed method, which ensured provision of the appropriate web service.     

基于邻接矩阵的Web服务组合

针对当前Web服务组合方法在动态性和算法时间复杂度方面存在的不足,提出一种基于邻接矩阵的服务组合方法,使用邻接矩阵表示服务间的顺序及并发关系,在构建抽象服务基础上由领域专家初步建立抽象服务的组合关系,利用Warshall算法计算传递闭包来判定服务请求是否可满足,同时构建动态服务组合流程。方法操作简单,Warshall算法时间复杂度为O(n3),在服务组合中有较好的实用性。     

Lifetime service level agreement management with autonomous agents for services provision

In the web services environment, service level agreements (SLA) refers to mutually agreed understandings and expectations between service consumers and providers on the service provision. Although management of SLA is critical to wide adoption of web services technologies in the real world, support for it is very limited nowadays, especially in web service composition scenarios. There lacks adequate frameworks and technologies supporting various SLA operations such as SLA formation, enforcement, and recovery. This paper presents a novel agent-based framework which utilises the agents’ ability of negotiation, interaction, and cooperation to facilitate autonomous SLA management in the context of service composition provision. Based on this framework, mechanisms for autonomous SLA operations are proposed and discussed. Results from simulations show that by integrating agents and web services the framework can address issues of SLA management drawn from sophisticated service composition scenarios.     

Service Composition and Execution Plan Generation of Composite Semantic WEB Services Using Abductive Event Calculus

Web Service composition is indispensable, as a single web service cannot satisfy the complex functional requirement of a user. The two key challenges of semantic web service composition are the discovery of the most relevant atomic services from the composite semantic web services and by no means we can assure the execution of the composed atomic services in a proper order. In this work, these two challenges are addressed, and a novel architecture is proposed for atomic service discovery, composition and automatic plan generation for the proper execution of its candidate services. The proposed architecture takes the advantage of abductive event calculus that uses abductive theorem prover to generate a plan for the proper order of execution of the atomic services. The research has found that the plan generated by the proposed architecture is sound and complete.     

基于Petri网的语义Web服务发现框架的研究

针对目前语义Web服务发现研究中存在的不足,提出一种基于Petri网的语义Web服务发现框架.该框架利用OWL-S本体提供的语义信息及Petir网在系统动态行为方面的验证功能,从服务注册中心发现用户所需的服务组合.Web服务的发现结果不仅满足用户的功能需求,而且保证无死锁并能够正确执行,提高了服务发现的准确性.最后通过实例分析验证了该服务发现框架的有效性.     

Quality-of-service oriented web service composition algorithm and planning architecture

In the next few decades, it is expected that web services will proliferate, many web services will offer the same services, and the clients will demand more value added and informative services rather than those offered by single, isolated web services. As the result, the problem of synthesizing web services of high quality will be raised as a prominent issue. The clients will face the trouble of choosing or creating composition plans, among numerous possible plans, that satisfy their quality-of-service (QoS) requirements. Typical QoS properties associated with a web service are the execution cost and time, availability, successful execution rate, reputation, and usage frequency. In engineering perspective, generating the composition plan that fulfills a client’s QoS requirement is a time-consuming optimization problem. To resolve the problem in a timely manner, we propose a constraint satisfaction based web service composition algorithm that combines tabu search and simulated annealing meta-heuristics. As an implementation framework of the algorithm, we suggest a QoS-oriented web service composition planning architecture. The architecture maintains expert made composition schemas in a service category and assists the client as pure user to choose the one he/she wants to use. The main modules of the architecture are composition broker and execution plan optimizer. With the aid of the UDDI server, the composition broker discovers candidate outsourced web services for each atomic process of the selected schema and gathers QoS information on the web services. After that, the execution plan optimizer runs the web service composition algorithm in order to generate a QoS-oriented composition plan. The performance of the algorithm was tested in a simulated environment.     

A dual-layered model for web services representation and composition

Nowadays more and more companies and organizations implement their business services in the Internet due to the tremendous progress made recently in the field of Web services. It becomes possible to publish, locate and invoke applications across the Web. Thus, the ability to select efficiently and integrate at runtime services located in different sites on the Web is an important issue. In some situations, if no single Web service can satisfy the request of the user, there should be a possibility to combine existing services together in order to meet the user’s request. This paper provides a dual-layered model for web services, where the first model layer captures the high-level functional specifications (namely goals, achievement contexts, and external behaviours), and the second model layer captures the low-level functional specifications (namely interfaces). This model allows the service composition process to be performed on both high-level and low-level specifications. We also introduce the composition operators (both high-level and low-level) to allow composition of virtual services.     

基于模糊Petri网的服务发现框架研究

现有的主流服务发现方法不支持模糊逻辑推理,无法处理软计算语义,从而缺乏灵活性.为了弥补人类可理解的软计算逻辑和机器能够识别的硬逻辑的差异,提出了面向服务基于模糊Petri网的Multi-Agent服务发现框架.为支持这一框架,设计了一种模糊Petri网服务描述语言,其主要特点是变迁表示一个服务或者请求;变迁的输入库所表示服务执行前应满足的条件,变迁的输出库所表示只有在所需条件满足的情况下服务才能成功执行.变迁相关的CF值(certainty factor value)表示服务消费者对Agent所提供服务的置信度.其次,提出了支持软计算语义的松弛匹配机制,并且给出了模糊松弛匹配算法;借助于本体库(类库),通过计算命题的真实度,在不精确模糊信息情况下,可以实现服务和请求的模糊松弛匹配.