Proceedings Article10.1109/CEC.2018.8477729
Cluster-Guided Genetic Algorithm for Distributed Data-intensive Web Service Composition
Soheila Sadeghiram,Hui Ma,Gang Chen +2 more
- 01 Jul 2018
- pp 1-7
24
TL;DR: A novel method based on Genetic Algorithm (GA) which uses a variation of K-means clustering algorithm to propose a communication cost and time model of a composed Web service considering communication delay and cost.
read more
Abstract: Automatic Web service composition has received much interest in the last decades. Data-intensive concepts have provided a promising computing paradigm for data-intensive Web service composition. Due to the complexity of the problem, metaheuristics in particular Evolutionary Computing (EC) techniques have been used for solving this composition problem. However, most of the current works neglected the distributed nature of data-intensive Web services. In this paper, we study the problem of distributed data-intensive service composition and propose a model which integrates attributes of constituent data-intensive Web services and attributes of the network. The core idea is to propose a communication cost and time model of a composed Web service considering communication delay and cost. We therefore propose a novel method based on Genetic Algorithm (GA) which uses a variation of K-means clustering algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey of Evolutionary Computation for Web Service Composition: A Technical Perspective
Alexandre Sawczuk da Silva,Hui Ma,Yi Mei,Mengjie Zhang +3 more
- 05 Feb 2020
TL;DR: The focus of this survey is on analysing existing works from a technical perspective, paying particular attention to the following key decisions when choosing an evolutionary computation-based approach for Web service composition.
26
QoS-driven metaheuristic service composition schemes: a comprehensive overview
TL;DR: A comprehensive survey and taxonomy of such QoS-oriented metaheuristic WS composition schemes provided in the literature is presented and how meta heuristic algorithms are adapted for the WS composition problem is investigated.
22
Hybrid Metaheuristics for QoS-Aware Service Composition: A Systematic Mapping Study
01 Jan 2022
TL;DR: In this paper , the authors present a survey of hybrid metaheuristics for QoS-aware service composition in cloud computing and provide a panoramic view of hybrid methods and their experiment setting.
Composing Distributed Data-intensive Web Services Using a Flexible Memetic Algorithm
Soheila Sadeghiram,Hui Ma,Gang Chen +2 more
- 01 Jun 2019
TL;DR: In this article, the authors proposed an MA-based approach to solve the problem of distributed Data-intensive Web Service Composition (DWSC) in an effective and efficient manner.
11
Composing Distributed Data-Intensive Web Services Using Distance-Guided Memetic Algorithm.
Soheila Sadeghiram,Hui Ma,Gang Chen +2 more
- 26 Aug 2019
TL;DR: This paper proposes an EC-based algorithm with novel crossover operators to effectively address the above challenges of data-intensive Web service compositions DWSC and shows that the proposed method is more effective than the existing methods.
11
References
The Skyline operator
S. Borzsony,Donald Kossmann,Konrad Stocker +2 more
- 02 Apr 2001
TL;DR: This work shows how SSL can be extended to pose Skyline queries, present and evaluate alternative algorithms to implement the Skyline operation, and shows how this operation can be combined with other database operations, e.g., join.
2.6K
Investigating QoS of Real-World Web Services
TL;DR: This work investigates QoS of real-world web services and provides reusable research data sets for validating various QoS-based techniques and models and releases comprehensive web service QoS data sets publicly released online.
461
Composing Web services: a QoS view
TL;DR: In previous columns, I've examined how quality of service (QoS) comes into play for service providers, consumers, and parallel transactions, and here, I'll show how it fits into composite Web services.
327
Internet QoS Routing Using the Bellman-Ford Algorithm
Dirceu Cavendish,Mario Gerla +1 more
- 21 Sep 1998
TL;DR: It is argued that a QoS version of the Bellman-Ford routing algorithm provides the best strategy for QoS routing problems of a given type, and it is shown that BellMan-Ford is very powerful in solving most multiple constrained routing problems arising in a flat network.