QoS-based Web Service Composition Applying an Improved Genetic Algorithm (IGA) Method

2016 ◽  
Vol 12 (3) ◽  
pp. 60-77 ◽  
Author(s):  
Pooya Shahrokh ◽  
Faramarz Safi-Esfahani
Keyword(s):  
Genetic Algorithm ◽  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Heuristic Method ◽  
Web Service Composition ◽  
Improved Genetic Algorithm ◽  
Functional Factors ◽  
Research Findings ◽  
The Difference

In recent years, it has been made possible to compose exiting services when a user's request cannot be satisfied by a single web service. Web service composition is faced with several challenges among which is the rapid growth in the number of available web services leading to increased number of web services offering the same functionalities. The difference between similar services is Quality of Service (QoS) consisting of various non-functional factors such as execution time, availability, security, etc. As a result, multiple choices are possible in making a composition plan. Among numerous plans, selecting a composition plan that fulfills customer's requirements has become an important and time-consuming problem. In this paper, the researchers propose a semi-heuristic genetic algorithm that is a combination of both a heuristic method and the genetic algorithm. This heuristic method changes chromosomes based on unsatisfied constraints. Research findings show that the proposed method can be applied to find a composition plan that satisfies user's requirements more efficiently than other methods.

An Improved Genetic Algorithm-Based Web Service Composition

2011 ◽  
Vol 225-226 ◽  
pp. 307-310 ◽  
Author(s):  
Long Hao
Keyword(s):  
Genetic Algorithm ◽  
Web Service ◽  
Service Composition ◽  
Web Service Composition ◽  
User Requirements ◽  
Improved Genetic Algorithm ◽  
Input And Output ◽  
Dynamic Service Composition ◽  
Multiple Input ◽  
Composite Services

In this paper a novel web service composition approach based on improved genetic algorithm is proposed. Firstly the relative vector is defined to represented the input and output parameters of user requirements and web services, by comparing the relative vectors, a composed service can be evaluated how much it match user requirements, thus the web service composition is transferred as a linear programming problem. Secondly an improved genetic algorithm is used to search optimum composite services. Compared with the existing approaches, this method supports dynamic service composition, bears component services with multiple input & output parameters, and enables inclusion of parallel and choice structure inside the composite services.

Case-Based Planning with User Preferences for Web Service Composition

2014 ◽  
Vol 6 (4) ◽  
pp. 58-71
Author(s):  
Yamina Hachemi ◽  
Sidi Mohamed Benslimane
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Web Service Composition ◽  
User Preferences ◽  
Functional Requirements ◽  
Key Factor ◽  
Functional Factors ◽  
Case Based ◽  
Selection Of

Web services composition has emerged as a solution to answer the requester's requirements. However, the selection of an appropriate Web service has become a difficult task due to the number of Web services present on the Web and mostly they offer similar functionalities. User preferences are a key factor that can be used to rank candidate services and retain only the best ones. To improve the process of web service composition the authors propose a Case-Based Planning (CBP) approach based on preferences which uses successful experiences in past to solve similar problems at present or/and in the future. How to make a choice base on non-functional factors becomes a problem that need to be solved. This paper, argues that the selection should be considered in a global manner based on the user's preferences. The authors present a framework that deals with web service composition based on user preferences and CBP method. Results obtained offer more than a solution to the user and taking both functional and non-functional requirements.

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.

Sign in / Sign up

Export Citation Format

Share Document