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>

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>

scholarly journals Genetic Programming for QoS-Aware Data-Intensive Web Service Composition and Execution

2021 ◽  
Author(s):  
◽  
Yang Yu
Keyword(s):  
Mathematical Model ◽  
Web Services ◽  
Genetic Programming ◽  
Web Service ◽  
Service Composition ◽  
Large Scale ◽  
Web Service Composition ◽  
Experimental Results ◽  
Multi Objective ◽  
Data Intensive

<p>Web service composition has become a promising technique to build powerful enterprise applications by making use of distributed services with different functions. In the age of big data, more and more web services are created to deal with a large amount of data, which are called data-intensive services. Due to the explosion in the volume of data, providing efficient approaches to composing data-intensive services will become more and more important in the field of service-oriented computing. Meanwhile, as numerous web services have been emerging to offer identical or similar functionality on the Internet, web service composition is usually performed with end-to-end Quality of Service (QoS) properties which are adopted to describe the non-functional properties (e.g., response time, execution cost, reliability, etc.) of a web service. In addition, the executions of composite web services are typically coordinated by a centralized workflow engine. As a result, the centralized execution paradigm suffers from inefficient communication and a single point of failure. This is particularly problematic in the context of data-intensive processes. To that end, more decentralized and flexible execution paradigms are required for the execution of data-intensive applications.  From a computational point of view, the problems of QoS-aware data-intensive web service composition and execution can be characterised as complex, large-scale, constrained and multi-objective optimization problems. Therefore, genetic programming (GP) based solutions are presented in this thesis to address the problems. A series of simulation experiments are provided to demonstrate the performance of the proposed approaches, and the empirical observations are also described in this thesis.  Firstly, we propose a hybrid approach that integrates the local search procedure of tabu search into the global search process of GP to solving the problem of QoS-aware data-intensive web service composition. A mathematical model is developed for considering the mass data transmission across different component services in a data-intensive service composition. The experimental results show that our proposed approach can provide better performance than the standard GP approach and two traditional optimization methods.  Next, a many-objective evolutionary approach is proposed for tackling the QoS-aware data-intensive service composition problem having more than three competing quality objectives. In this approach, the original search space of the problem is reduced before a recently developed many-objective optimization algorithm, NSGA-III, is adopted to solve the many-objective optimization problem. The experimental results demonstrate the effectiveness of our approach, as well as its superiority than existing single-objective and multi-objective approaches.  Finally, a GP-based approach to partitioning a composite data-intensive service for decentralized execution is put forth in this thesis. Similar to the first problem, a mathematical model is developed for estimating the communication overhead inside a partition and across the partitions. The data and control dependencies in the original composite web service can be properly preserved in the deployment topology generated by our approach. Compared with two existing heuristic algorithms, the proposed approach exhibits better scalability and it is more suitable for large-scale partitioning problems.</p>

scholarly journals Genetic Programming for QoS-Aware Data-Intensive Web Service Composition and Execution

2021 ◽  
Author(s):  
◽  
Yang Yu
Keyword(s):  
Mathematical Model ◽  
Web Services ◽  
Genetic Programming ◽  
Web Service ◽  
Service Composition ◽  
Large Scale ◽  
Web Service Composition ◽  
Experimental Results ◽  
Multi Objective ◽  
Data Intensive

<p>Web service composition has become a promising technique to build powerful enterprise applications by making use of distributed services with different functions. In the age of big data, more and more web services are created to deal with a large amount of data, which are called data-intensive services. Due to the explosion in the volume of data, providing efficient approaches to composing data-intensive services will become more and more important in the field of service-oriented computing. Meanwhile, as numerous web services have been emerging to offer identical or similar functionality on the Internet, web service composition is usually performed with end-to-end Quality of Service (QoS) properties which are adopted to describe the non-functional properties (e.g., response time, execution cost, reliability, etc.) of a web service. In addition, the executions of composite web services are typically coordinated by a centralized workflow engine. As a result, the centralized execution paradigm suffers from inefficient communication and a single point of failure. This is particularly problematic in the context of data-intensive processes. To that end, more decentralized and flexible execution paradigms are required for the execution of data-intensive applications.  From a computational point of view, the problems of QoS-aware data-intensive web service composition and execution can be characterised as complex, large-scale, constrained and multi-objective optimization problems. Therefore, genetic programming (GP) based solutions are presented in this thesis to address the problems. A series of simulation experiments are provided to demonstrate the performance of the proposed approaches, and the empirical observations are also described in this thesis.  Firstly, we propose a hybrid approach that integrates the local search procedure of tabu search into the global search process of GP to solving the problem of QoS-aware data-intensive web service composition. A mathematical model is developed for considering the mass data transmission across different component services in a data-intensive service composition. The experimental results show that our proposed approach can provide better performance than the standard GP approach and two traditional optimization methods.  Next, a many-objective evolutionary approach is proposed for tackling the QoS-aware data-intensive service composition problem having more than three competing quality objectives. In this approach, the original search space of the problem is reduced before a recently developed many-objective optimization algorithm, NSGA-III, is adopted to solve the many-objective optimization problem. The experimental results demonstrate the effectiveness of our approach, as well as its superiority than existing single-objective and multi-objective approaches.  Finally, a GP-based approach to partitioning a composite data-intensive service for decentralized execution is put forth in this thesis. Similar to the first problem, a mathematical model is developed for estimating the communication overhead inside a partition and across the partitions. The data and control dependencies in the original composite web service can be properly preserved in the deployment topology generated by our approach. Compared with two existing heuristic algorithms, the proposed approach exhibits better scalability and it is more suitable for large-scale partitioning problems.</p>

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.

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.

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.

Sign in / Sign up

Export Citation Format

Share Document