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 user centric service-oriented modeling approach

With rapid development of service-oriented architecture and cloud computing, web services have been widely employed on the Internet. Quality of Service (QoS) is a very important criterion for service consumers to measure and select services. The selection of web services with respect to non-functional QoS criteria can be considered as a Multiple Criteria Decision Making (MCDM) problem when multiple consumers need to share a number of services. This paper describes a new user centric service-oriented modeling approach which is featured by integrating fuzzy Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) and Service Component Architecture (SCA) to facilitate web service selection and composition and to effectively satisfy a group of service consumers’ subjective requirements and preferences in the dynamic environment. The main contribution of this method is able to translate a group of users’ fuzzy requirements to services as well as model different levels of hardware and software as services to meet the requirements. We also design a simulated environment that includes 8*8 LED matrix on a circuit board that corresponds to an office with different appliances to demonstrate the dynamic service selection and binding. The simulation is used to assess the computational efficiency of the fuzzy TOPSIS method and the effectiveness of the proposed system.     

A monolithic approach to automated composition of semantic web services with the Event Calculus

In this paper, a web service composition and execution framework is presented for semantically -annotated web services. A monolithic approach to automated web service composition and execution problem is chosen, which provides some benefits by separating composition and execution phases. An AI planning method using a logical formalism, namely Abductive Event Calculus, is chosen for the composition phase. This formalism allows one to generate a narrative of actions and temporal orderings using abductive planning techniques given a goal. The functional properties of services, namely input/output/precondition/effects (IOPE) are taken into consideration in the composition phase and non-functional properties, namely Quality of Service (QoS) parameters are used in selecting the most appropriate solution to be executed. The repository of OWL-S semantic web services are translated to the Event Calculus axioms and the resulting plans found by the Abductive Event Calculus Planner are converted to graphs. These graphs can be sorted according to a score calculated using the defined quality of service parameters of the atomic services in the composition to determine the optimal solution. The selected graph is converted to an OWL-S file which is executed consequently.     

基于可信QoS的路径查找及负载均衡策略研究

Web服务是云计算中资源调用的有效方式。单一Web服务功能往往有限,只能完成特定任务。服务组合则可以将多种Web服务形成有效的调用序列,实现更为强大的功能。服务发布量以及服务请求量的迅速激增带来了新的安全问题。首先,现有的服务组合方案均以服务质量(QoS)为依据进行Web服务选择,但服务质量通常由服务发布者提供,存在服务发布者发布虚假QoS值诱骗用户的欺诈现象;其次,传统的服务组合方案只生成一条最优路径,当恶意请求持续访问时,会造成某服务节点瘫痪,甚至整个服务组合系统失效。因此,针对服务质量恶意欺诈的问题,文章提出一种可信的QoS计算模型,根据Web服务发布者的信用综合评估服务质量;针对单一最优路径无法满足大量请求的问题,文章提出一种路径发现和负载均衡的多路径方法。仿真结果表明,文章提出的方法不仅能提高服务组合的成功率,满足用户的需求,而且能找到更多的服务组合方案执行。     

基于服务质量的Web服务发现研究与实现

随着Web服务的广泛应用,网络上提供的服务数量越来越多,如何在动态的环境下从海量的Web服务中找到满足用户需求的最优服务就成了Web服务应用急需解决的问题.介绍了服务质量的量化评价方法,并且在不改变传统Web服务架构的基础上,建立了一种基于服务质量的Web服务三层匹配模型,最后实验结果证明了该模型的可行性.     

一种基于组合赋权法的Web服务选择策略*

针对Web服务选择中服务请求偏好权重表达的模糊性及服务质量(QoS)属性值间存在的相互制约关系等问题,提出一种基于组合赋权法的Web服务选择策略。首先利用模糊层次分析法(FAHP)和主成分分析法(PCA)分别计算主观QoS权重和客观QoS权重;然后综合主、客观QoS权重利用组合赋权法(CWA)计算服务请求的综合QoS权重;最后提出一种综合评价函数,以保障所选择的服务在满足服务请求偏好的基础上,能更准确地反映候选Web服务总体QoS水平。实例分析表明该方法是有效的。     

Globally optimal selection of web composite services based on univariate marginal distribution algorithm

Quality of service (QoS) model of composite services and web service selection based on QoS are currently the hot issues in the web service composition area. Service selection based on QoS, which is a globally optimal selection issue, is a NP-hard problem. Taking engine into consideration, this paper develops a QoS model for service selection in the web composite services. We use the algorithm on the estimation of distribution to solve the NP-hard problem of service selection and present a web service selection method based on the univariate marginal distribution algorithm (UMDA). Simulation analysis and experimental study based on the UMDA method are carried out. It is proved that the method is effective in solving the NP-hard problem.     

On optimal decision for QoS-aware composite service selection

The increasing popularity of employing web services for distributed systems contributes to the significance of service discovery. However, duplicated and similar functional features existing among services require service consumers to include additional aspects to evaluate the services. Generally, the service consumers would have different view on the quality of service (QoS) of service attributes. How to select the best composite service in theory among available service (WS) candidates for consumers is an interesting practical issue. This work proposes a QoS-aware service selection model based on fuzzy linear programming (FLP) technologies, in order to identify their dissimilarity on service alternatives, assist service consumers in selecting most suitable services with consideration of their expectations and preferences. This approach can obtain the optimal solution of consensual weight of QoS attribute and fuzzy positive ideal solution (FPIS) by extending LINMAP method, developed by Srinivasan and Shocker. Finally, two numerical examples are given to demonstrate the process of QoS-aware web service selection. The experimental results demonstrated that it is a feasible and supplementary manner in selecting the of web services.     

Functionality Aware Dynamic Composition of Web Services

The composition of the web service is a common technique to attain the best results of complex web tasks. The selection of appropriate web services, linking those services in the action flow and attaining the actual functionality of the task are the important factors to be considered. Even though different frameworks and methods have been proposed to dynamically compose web services, each method has its advantage and disadvantage over the other. Most of the methods give much importance to the Quality of Service (QoS) but fail to achieve the actual functionality after composition. This paper proposes a functionality-oriented composition technique for composing web services. Moreover, this method helps reach the extreme functionality of each web service in the composition towards customer satisfaction. Apart from considering the overall QoS of every single service, the non-functional parameters associated with these services are also considered for achieving the expected functionality. Each of these non-functional parameters has a vital role in the functional performance of the web service. The web services that satisfy the non-functional requirements are chosen to form the composition to attain the best performance. The list of services in the proposed composition method is different from the conventional one, which is composed based on the overall QoS. The non-functional parametric values, the QoS of each web service and the overall QoS after composition are evaluated for the proposed method and experimentally analyzed to prove their advantage over the others.     

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.     

User-centered design of a QoS-based web service selection system

In most of quality of service (QoS)-based web service selection systems, inexperienced end users are not the focal point of the design. Most systems assume that users could formulate their QoS requirements easily and are accurately using the provided query languages. However, oftentimes it is not true. To tackle this issue and emphasize more on the user-centered design of the service selection system, in this paper, we come up with a more expressive and flexible way for non-expert users to define their QoS queries, together with the user support on formulating queries and understanding services in the registry. Then, we propose an enhanced selection model that could handle both exact and fuzzy requirements, return two categories of matching offers—super-exact and partial matches, and rank them using a two-level ranking algorithm. A prototype system is implemented, and experiments are done using a real QoS dataset to show the system performance.     

Web服务聚类方法的研究和改进

Web服务的聚类能够改善基于服务的应用如服务发现、组合和QoS预测等.然而目前的聚类方法在相似度度量和信息预处理方面存在一些不足.提出Web服务的QoS和功能两种相似度模型,从不同角度度量服务间的相似度.在此基础上,提出一种特殊的考虑到编程风格和命名规则的预处理方法.最后结合SCAN算法实现了本方法并设计了对比实验对提出的方法进行验证.实验结果表明提出的模型和方法能够有效地提高Web服务的聚类效果.     

Web service composition on IoT reliability test based on cross entropy

Web service has developed the managed IoT application to let connected devices easily and securely interact with cloud applications and other devices. As an important factor for web service, the reliability of web services refers to the probability of web service running success. For modeling web service composition, we should abstract the process of web service composition. Due to the diversity and complexity of web service composition, it is unlikely to do exhaustive testing. In order to improve the quality of web service composition test cases and find out which path leads to the greatest probability of service combination failure, heuristic test case generation method is adopted to obtain the optimal test path. First, the web service composition test is abstracted into the MDP model. The QoS of the web service composition is taken as the software test optimization goal, and the cross-entropy strategy is used to optimize the test case. The experimental results show that the test profile given by the cross-strategy is better than the random test strategy. Detect and exclude the same number of software defects. Cross-entropy strategy can significantly reduce the number of test cases, reduce test costs, and improve defect detection efficiency.     

基于禁忌搜索算法的Web服务组合优化

为有效集成网络中的Web服务,组成满足用户需求的服务链,提出了基于禁忌搜索算法的Web服务组合优化方法.建立了基于QoS感知的Web服务组合优化模型,该模型从全局限制了用户的QoS约束.简述了禁忌搜索算法求解的基本框架,在此基础之上分析了应用禁忌搜索算法求解过程中的关键设计步骤.实例仿真计算结果表明,该算法求解具有比线性规划算法更好的时间性能,并具有与遗传算法相仿的表现.     

Multi-group QoS consensus for web services

QoS has been considered as a significant factor for web service marketing and selection. The interpretation of QoS value from web service consumers and providers would be very different. However, a large group of web service participants with different backgrounds may have difficulties in reaching consensus on the values of multi-dimensional web service QoS, so they may have to be clustered in multi-groups in order to improve effectiveness and efficiency. The similarity of clustered fuzzy QoS dispositions as well as their preference order over these attributes should be analyzed to form a multi-groups consensus framework. A soft multi-groups clustering approach could be adopted to prevent opinions from being excluded unintentionally. The group boundaries and similarity thresholds which are used for clustering and analyzing fuzzy QoS opinions can be moderated dynamically according to the feedback from the internal learning mechanism and the web service consumers. As a result, a model for marketing web services based on multi-group consumers' QoS consensus, the FMG-QCMA (Fuzzy Multi-Groups based QoS Consensus Moderation Approach), is proposed to meet the above requirements. The proposed FMG-QCMA is also evaluated through a case study to demonstrate its effectiveness and efficiency in relation to an existing framework, QCMA (QoS Consensus Moderation Approach).     

一种基于QoS的Web服务智能动态组合模型

针对当前Web服务数量剧增以及Web服务QoS综合评价不合理而导致Web服务组合效率和效用不高的问题,改进了Web服务组合中QoS计算模型,利用综合变权法动态调整每个Web服务多个属性的权值,并采用改进的粒子群算法来解决服务动态组合中QoS全局优化的问题.实验结果表明,该模型能够合理的选择和组合众多功能相同的服务,提高...     

Resource virtualization and service selection in cloud logistics

Cloud computing and Internet of Things have promoted a new logistics service mode, i.e., the cloud logistics mode. This work studies the resource virtualization and service encapsulation of a logistics center, and focuses on the technologies of resource expression and service encapsulation. After the resources of a logistics center are encapsulated in web services, how to find the “best” concrete web service among many is a critically important issue. This work considers service selection as an optimization problem and establishes a Particle Swarm Optimization (PSO)-based web service selection model with quality of service (QoS) constraints. It can be used to address the horizontal adaptation issues from the composite web services. The feasibility and effectiveness of the model are verified by several experiments.     

动态Web服务合成中的服务选择算法研究

为了提高服务合成效率并更好的适应动态变化的应用环境,提出了基于流程修改的服务合成方案,使得复合服务的执行与服务发现过程并行化。提出了基于QoS属性的服务选择算法,该算法能够实现服务执行时选择服务,在考虑综合QoS信息及时间因素的基础上,通过不断更新用户需求来进行服务选择,提高了服务合成效率。实验结果表明,该选择算法可以获得满足用户需求且最优的服务,很好的保证了服务的可靠执行。