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.

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 Distributed Data-intensive Web Service Composition

2021 ◽  
Author(s):  
Soheila Sadeghiram
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Problem Formulation ◽  
Web Service Composition ◽  
User Preferences ◽  
Distributed Data ◽  
Multi Objective ◽  
Data Intensive ◽  
The Impact

<p>Service-oriented architecture (SOA) encourages the creation of modular applications involving Web services as the reusable components. Data-intensive Web services have emerged to manipulate and deal with the massive data emerged from technological advances and their various applications. Distributed Data-intensive Web Service Composition (DWSC) is a core of SOA, which includes the selection of data-intensive Web services from diverse locations on the network and composes them to accomplish a complicated task. As a fundamental challenge for service developers, service compositions must fulfil functional requirements and optimise Quality of Service (QoS), simultaneously. The QoS of a distributed DWSC is not only impacted by the QoS of component services and how the compositions are generated, but also by the locations of services and data transformation between services. However, existing works often neglect the impact of locations and data on service composition. The distributed DWSC has not been sufficiently studied in the literature. In this thesis, we first define the single-objective distributed DWSC that includes communication (e.g. bandwidth), Web service (execution time) and data (data cost) attributes. To this aim, we consider bandwidth information of communication links obtained using the location information of services. Based on the problem formulation, we then address the distributed DWSC problem by developing EC-based approaches. Those EC-based approaches are designed to incorporate domain-knowledge for effectively solving the distributed DWSC problem. Afterwards, we study the multi-objective distributed DWSC to satisfy different QoS requirements. In particular, the QoS-constrained distributed DWSC problem and user preferences are considered. For finding trade-off solutions for those problems, new Multi-objective Evolutionary Algorithms (MOEAs) are proposed based on the current Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Furthermore, a new problem formulation for the dynamic distributed DWSC (D2−DWSC) problem with bandwidth fluctuations is proposed. An EC-based approach is developed to solve the D2-DWSC. Finally, extensive empirical evaluations are conducted that demonstrate the high performance of our proposed methods in finding composite services with good QoS.</p>

User Preference-Based Web Service Composition and Execution Framework

2015 ◽  
pp. 118-138 ◽  
Author(s):  
Bassam Al-Shargabi ◽  
Omar Sabri
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Oriented Architecture ◽  
Wide Spectrum ◽  
Web Service Composition ◽  
User Preferences ◽  
User Preference ◽  
Service Oriented ◽  
Composition Process

the motivation behind this chapter is that Service Oriented architecture issued to compose an application as a set of services that are language and platform independent, communicate with each other, Therefore, user preferences rules in web service composition process plays crucial role and has opened a wide spectrum of challenge, In this chapter, an agent for composing web services based on user preferences was introduced to fulfill a certain process, where the user preferences are essential for determining which web service are to be selected. In other word, the agent designed to maintain the following function: an intelligent web services selection and planning based on user preferences(such as price or availability), along with web services execution, tracking and adaptation.

scholarly journals An Automatic Web Service Composition Framework Using QoS-Based Web Service Ranking Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-14 ◽  
Author(s):  
Deivamani Mallayya ◽  
Baskaran Ramachandran ◽  
Suganya Viswanathan
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Web Applications ◽  
Web Service Composition ◽  
User Preferences ◽  
User Preference ◽  
Global Constraints ◽  
Service Ranking ◽  
The Web

Web service has become the technology of choice for service oriented computing to meet the interoperability demands in web applications. In the Internet era, the exponential addition of web services nominates the “quality of service” as essential parameter in discriminating the web services. In this paper, a user preference based web service ranking (UPWSR) algorithm is proposed to rank web services based on user preferences and QoS aspect of the web service. When the user’s request cannot be fulfilled by a single atomic service, several existing services should be composed and delivered as a composition. The proposed framework allows the user to specify the local and global constraints for composite web services which improves flexibility. UPWSR algorithm identifies best fit services for each task in the user request and, by choosing the number of candidate services for each task, reduces the time to generate the composition plans. To tackle the problem of web service composition, QoS aware automatic web service composition (QAWSC) algorithm proposed in this paper is based on the QoS aspects of the web services and user preferences. The proposed framework allows user to provide feedback about the composite service which improves the reputation of the services.

An Agent Architecture for Qos-Based Web Service Composition Using the Skyline Algorithm

2017 ◽  
Vol 6 (3) ◽  
pp. 179 ◽  
Author(s):  
El-Alami Ayoub ◽  
Hair Abdellatif
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Selection ◽  
Web Service Composition ◽  
Web Service Selection ◽  
Concrete Service ◽  
The Web ◽  
Selection Of

<p>Web service composition is a concept based on the built of an abstract process, by combining multiple existing class instances, where during the execution, each service class is replaced by a concrete service, selected from several web service candidates. This approach has as an advantage generating flexible and low coupling applications, based on its conception on many elementary modules available on the web. The process of service selection during the composition is based on several axes, one of these axes is the QoS-based web service selection. The Qos or Quality of Service represent a set of parameters that characterize the non-functional web service aspect (execution time, cost, etc...). The composition of web services based on Qos, is the process which allows the selection of the web services that fulfill the user need, based on its qualities. Selected services should optimize the global QoS of the composed process, while satisfying all the constraints specified by the client in all QoS parameters. In this paper, we propose an approach based on the concept of agent system and Skyline approach to effectively select services for composition, and reducing the number of candidate services to be generated and considered in treatment. To evaluate our approach experimentally, we use a several random datasets of services with random values of qualities.</p>

scholarly journals Distributed Data-intensive Web Service Composition

2021 ◽  
Author(s):  
Soheila Sadeghiram
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Problem Formulation ◽  
Web Service Composition ◽  
User Preferences ◽  
Distributed Data ◽  
Multi Objective ◽  
Data Intensive ◽  
The Impact

<p>Service-oriented architecture (SOA) encourages the creation of modular applications involving Web services as the reusable components. Data-intensive Web services have emerged to manipulate and deal with the massive data emerged from technological advances and their various applications. Distributed Data-intensive Web Service Composition (DWSC) is a core of SOA, which includes the selection of data-intensive Web services from diverse locations on the network and composes them to accomplish a complicated task. As a fundamental challenge for service developers, service compositions must fulfil functional requirements and optimise Quality of Service (QoS), simultaneously. The QoS of a distributed DWSC is not only impacted by the QoS of component services and how the compositions are generated, but also by the locations of services and data transformation between services. However, existing works often neglect the impact of locations and data on service composition. The distributed DWSC has not been sufficiently studied in the literature. In this thesis, we first define the single-objective distributed DWSC that includes communication (e.g. bandwidth), Web service (execution time) and data (data cost) attributes. To this aim, we consider bandwidth information of communication links obtained using the location information of services. Based on the problem formulation, we then address the distributed DWSC problem by developing EC-based approaches. Those EC-based approaches are designed to incorporate domain-knowledge for effectively solving the distributed DWSC problem. Afterwards, we study the multi-objective distributed DWSC to satisfy different QoS requirements. In particular, the QoS-constrained distributed DWSC problem and user preferences are considered. For finding trade-off solutions for those problems, new Multi-objective Evolutionary Algorithms (MOEAs) are proposed based on the current Non-dominated Sorting Genetic Algorithm-II (NSGA-II). Furthermore, a new problem formulation for the dynamic distributed DWSC (D2−DWSC) problem with bandwidth fluctuations is proposed. An EC-based approach is developed to solve the D2-DWSC. Finally, extensive empirical evaluations are conducted that demonstrate the high performance of our proposed methods in finding composite services with good QoS.</p>

Using Planning and Case-Based Reasoning for Service Composition

2010 ◽  
Vol 14 (5) ◽  
pp. 540-548 ◽  
Author(s):  
Chiung-Hon Leon Lee ◽  
◽  
Alan Liu ◽  
Huan-Hsian Huang ◽  
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Composition ◽  
Service Providers ◽  
Web Service Composition ◽  
User Needs ◽  
Case Based Reasoning ◽  
Service Model ◽  
Related Information ◽  
Case Based

Planning commonly applied to automating Web Service composition involves two problems - (i) overlooked user needs combined with services provided by the systems themselves and outside services providing a much more flexible service model. (ii) “Speeding up” and “facilitating” services by not recording information about service providers already having served users and about planning already processed. We propose merging internal and external services to meet user needs. Internal services include system functions designed to meet user needs. External services mean Web services provided by outside service providers. We plan to combine both types of services to create planning to meet user needs. We apply case-based reasoning to store planning and related information in a case base to make planning much faster when users have similar needs.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document