Hybrid metaheuristics using rough sets for QoS-aware service composition

Naghavipour, Hadi and Bin Idris, Mohd Yamani Idna and Soon, Tey Kok and Salleh, Rosli and Gani, Abdullah (2022) Hybrid metaheuristics using rough sets for QoS-aware service composition. IEEE Access, 10. pp. 112609-112628. ISSN 2169-3536, DOI https://doi.org/10.1109/ACCESS.2022.3213705.

Full text not available from this repository.

Abstract

Quality of Service (QoS)-aware service composition plays an increasingly important role in various computational paradigms and delivery models, predominantly cloud computing. The proliferation of services with expanding quality attributes navigates this problem towards big service compositions, which fall under the umbrella of NP-hard. Within the realm of big services, performing composition also became a computationally expensive and challenging task. Since service composition is an NP-hard problem, numerous research aimed to determine optimal or near-optimal solutions within a reasonable computation budget. A large body of evidence suggests that metaheuristics could realize this goal to some extent. However, the proliferation of services with expanding quality attributes (search dimensions) may fail the most efficient techniques. In order to deal with the problem of big service composition, one trending approach has been devising hybrid metaheuristics methods by incorporating clustering techniques to minimize search space. This paper proposes a hybrid metaheuristic incorporated with a maximal discernibility heuristic based on rough set theory to perform composition in the subset of search space. Moreover, it introduces a parallel processing and monitoring mechanism to provide immunity against premature convergence when the search space is minimized. The experiment was conducted for 25 datasets generated incrementally from a real-world QWS dataset, where the proposed hybrid solution effectively improves solution quality and reduces execution time with a statistical significance of 99 % confidence interval across diverse metaheuristics and datasets.

Item Type: Article
Funders: Malaysian Ministry of Higher Education through the Fundamental Research Grant Scheme [FRGS/1/2021/ICT11/UM/02/1 (FP005-2021)]
Uncontrolled Keywords: Metaheuristics; Cloud computing; Quality of service; Search problems; Rough sets; Convergence; Cloud computing; Quality of service; Service composition; Metaheuristics; Hybrid metaheuristics; Rough sets
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Computer Science & Information Technology
Depositing User: Ms. Juhaida Abd Rahim
Date Deposited: 29 Aug 2023 07:37
Last Modified: 29 Aug 2023 07:37
URI: http://eprints.um.edu.my/id/eprint/41012

Actions (login required)

View Item View Item