scholarly journals A Bayesian Approach Based on Bayes Minimum Risk Decision for Reliability Assessment of Web Service Composition

2020 ◽  
Vol 12 (12) ◽  
pp. 221
Author(s):  
Yang Song ◽  
Yawen Wang ◽  
Dahai Jin
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Reliability Assessment ◽  
Web Service Composition ◽  
System Level ◽  
Minimal Risk ◽  
Scoring Method ◽  
Minimum Risk ◽  
Wrong Decision

Web service composition is the process of combining and reusing existing web services to create new business processes to satisfy specific user requirements. Reliability plays an important role in ensuring the quality of web service composition. However, owing to the flexibility and complexity of such architecture, sufficient estimation of reliability is difficult. In this paper, the authors propose a method to estimate the reliability of web service compositions based on Bayes reliability assessment by considering it to be a decision-making problem. This improves the testing efficiency and accuracy of such methods. To this end, the authors focus on fully utilizing prior information of web services to increase the accuracy of prior distributions, and construct a Markov model in terms of the reliabilities of the web composition and each web service to integrate the limited test data. The authors further propose a method of minimum risk (MMR) to calculate the initial values of hyperparameters satisfying the constraint of minimal risk of the wrong decision. Experiments demonstrate that the proposed method is capable of efficiently utilizing prior module-level failure information, comparing with the Bayesian Monte Carlo method (BMCM) and expert scoring method (ESM), when the number of failures increased from 0 to 5, reducing the required number of test cases from 19.8% to 28.9% and 6.1% to 14.1% separately, improving the reliability assessment of web service compositions, and reducing the expenses incurred by system-level reliability testing and demonstration.

QoS–Aware Web Service Composition using Weight Improved Particle Swarm Optimization

2021 ◽  
Vol 9 (2) ◽  
pp. 65-70
Author(s):  
Laishram Jenny Chanu ◽  
◽  
Arnab Paul ◽  
Keyword(s):  
Particle Swarm Optimization ◽  
Web Services ◽  
Web Service ◽  
Optimization Algorithm ◽  
Service Composition ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Web Service Composition ◽  
Swarm Optimization ◽  
Complex Query

Lots of Web Services are available which differ in their QoS values but can perform a similar task. Discovery mechanism selects the best Web Service according to their QoS values and functional attributes. Cases arise, where the discovery mechanism fails, as a user’s complex query cannot be satisfied by a single Web Service. This can be solved by Web Service composition where multiple Web Services are combined to give a composite Web Service which meet user’s complex query. Our work is mainly focused on composition of Web Services that efficiently meets the user’s query. Different algorithms have been discussed and used by different researchers in this field. One of the most blooming topics is the use of evolutionary algorithms in optimization problems. In our work, we have chosen Particle Swarm Optimization Algorithm approach to discover the best efficient composition. Then, Weight Improved Particle Swarm Optimization Algorithm is used to improve the results which were found to be quite satisfying and efficient.

Service Composition Verification and Validation

2013 ◽  
pp. 200-219
Author(s):  
Manuel Palomo-Duarte
Keyword(s):  
Web Services ◽  
Software Development ◽  
Web Service ◽  
Service Composition ◽  
Web Service Composition ◽  
Verification And Validation ◽  
Loosely Coupled ◽  
Program Testing ◽  
Traditional Program ◽  
Programming Systems

Web services are changing software development thanks to their loosely coupled nature and simple adoption. They can be easily composed to create new more powerful services, allowing for large programming systems. Verification and validation techniques try to find defects in a program to minimize losses that its malfunction could cause. Although many different approaches have been developed for “traditional” program testing, none of them have proven definitive. The problem is even more challenging for new paradigms like web services and web service compositions, because of their dynamic nature and uncommon web service-specific instructions. This chapter surveys the different approaches to web service and web service composition verification and validation, paying special attention to automation. When no tools are available for a given technique, academic efforts are discussed, and challenges are presented.

WSBen

2011 ◽  
pp. 739-758 ◽  
Author(s):  
Seog-Chan Oh ◽  
Dongwon Lee
Keyword(s):  
Statistical Analysis ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Network Models ◽  
Web Service Composition ◽  
Ai Planning ◽  
Underlying Network ◽  
Test Sets ◽  
Diverse Data

In this article, a novel benchmark toolkit, WSBen, for testing web services discovery and composition algorithms is presented. The WSBen includes: (1) a collection of synthetically generated web services files in WSDL format with diverse data and model characteristics; (2) queries for testing discovery and composition algorithms; (3) auxiliary files to do statistical analysis on the WSDL test sets; (4) converted WSDL test sets that conventional AI planners can read; and (5) a graphical interface to control all these behaviors. Users can finetune the generated WSDL test files by varying underlying network models. To illustrate the application of the WSBen, in addition, we present case studies from three domains: (1) web service composition; (2) AI planning; and (3) the laws of networks in Physics community. It is our hope that WSBen will provide useful insights in evaluating the performance of web services discovery and composition algorithms. The WSBen toolkit is available at: http://pike.psu.edu/sw/wsben/.

Applying Evolutionary Many-Objective Optimization Algorithms to the Quality-Driven Web Service Composition Problem

2016 ◽  
pp. 170-194
Author(s):  
Arion de Campos Jr. ◽  
Aurora T. R. Pozo ◽  
Silvia R. Vergilio
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Optimization Algorithms ◽  
Web Service Composition ◽  
Nsga Ii ◽  
Preference Relations ◽  
Multi Objective ◽  
Composition Problem

The Web service composition refers to the aggregation of Web services to meet customers' needs in the construction of complex applications. The selection among a large number of Web services that provide the desired functionalities for the composition is generally driven by QoS (Quality of Service) attributes, and formulated as a constrained multi-objective optimization problem. However, many equally important QoS attributes exist and in this situation the performance of the multi-objective algorithms can be degraded. To deal properly with this problem we investigate in this chapter a solution based in many-objective optimization algorithms. We conduct an empirical analysis to measure the performance of the proposed solution with the following preference relations: Controlling the Dominance Area of Solutions, Maximum Ranking and Average Ranking. These preference relations are implemented with NSGA-II using five objectives. A set of performance measures is used to investigate how these techniques affect convergence and diversity of the search in the WSC context.

A Novel Physics Inspired Approach for Web Service Composition

2014 ◽  
Vol 11 (2) ◽  
pp. 67-84 ◽  
Author(s):  
Tanveer Ahmed ◽  
Abhishek Srivastava
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Oriented Architecture ◽  
Service Providers ◽  
Web Service Composition ◽  
Heterogeneous Services ◽  
Service Oriented ◽  
Service Consumer ◽  
Selection Of

Service oriented architecture has revolutionized the way a traditional business process is executed. The success of this architecture is Indue to the composition of multiple heterogeneous services at runtime. Web service composition is a mechanism where several web services are combined at runtime to build a complex application for a user. It is one of the most sought after processes in the context of semantic web. But, composition of web services at runtime is a difficult task owing to the availability of multiple service providers offering the same functionality. The process if exasperated by due conflicting preferences of a service consumer. In this paper, the authors address the issue of selecting a service based on Quality of Service (QoS) attributes. They utilize concepts customized from physics to create an environment that facilitates the selection of a best service from the set of similar services. The technique not only facilitates the selection of the service with the best QoS attributes, but distributes the load among expeditiously. Here in this paper, the authors concentrate on minimizing and equitably balancing the waiting time for a user. They conduct in silico experiments on multiple workflows to demonstrate the efficacy of the proposed technique to balance load efficiently among similar service offerings.

scholarly journals Mutation-Based Harmony Search Algorithm for Hybrid Testing of Web Service Composition

2018 ◽  
Vol 2018 ◽  
pp. 1-15 ◽  
Author(s):  
Eckwijai Maythaisong ◽  
Wararat Songpan
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Providers ◽  
Search Algorithm ◽  
Harmony Search ◽  
Web Service Composition ◽  
Hybrid Testing ◽  
Business Plans ◽  
Business Goals

Web service composition is a method of developing a new web service from an existing one based on business goals. Web services selected for composition should provide accurate operational results and reliable applications. However, most alternative service providers have not yet fulfilled users’ needs in terms of services and processes. Service providers, in fact, have focused on enhancing nonfunctional attributes, such as efficiencies of time, cost, and availability, which still face limitations. Furthermore, it remains advantageous to compose services and suitably plan them around business plans. Thus, this study introduces hybrid testing using a combination of the functional and nonfunctional testing approaches. The former was used to design a test case through the equivalence class partitioning technique, and the latter was used to select suitable services for the test results. We find defects and appropriate solutions for combining services based on business requirements. The mutation-based harmony search (MBHS) algorithm is proposed to select web services and to compose with minimum defects. The results of this study reveal that MBHS can support a combination of various services more efficiently and dramatically than other metaheuristic methodologies. Additionally, it helps find appropriate solutions to compose services based on business plans.

A Web Service Composition Algorithm Based on Graph Search and Semantic Web

2014 ◽  
Vol 687-691 ◽  
pp. 1637-1640
Author(s):  
Liang Liang Hao
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Web Service ◽  
Service Composition ◽  
Semantic Information ◽  
Web Service Composition ◽  
Graph Search ◽  
Input Output

With the Development of web service technology, a single web service cannot fulfill different users’ diverse requirements. Adding semantic information to the input-output message of web services provides us a method to implement web service composition automatically. After researching on existing algorithms for web service composition, this article proposed a QoS-oriented web service composition algorithm based on graph search with semantic information.

Sign in / Sign up

Export Citation Format

Share Document