Title: Using the SCRM method to repair a damaged planning graph for service composition

Authors: Zhihao Gao; Ming Zhu; Jing Li; Rui Lu

Addresses: College of Computer Science and Technology, Shandong University of Technology, Zibo, China ' College of Computer Science and Technology, Shandong University of Technology, Zibo, China ' College of Computer Science and Technology, Shandong University of Technology, Zibo, China ' College of Engineering and Computer Science, The Australian National University, Canberra, Australia

Abstract: Software, hardware, data, and computing power can be abstracted and encapsulated as services authorised to users in a paid or free manner for on demand deployment. Service composition combines multiple existing services in a certain logical order to solve complex tasks that a single service cannot complete. Many AI approaches have been proposed to solve service composition problems. However, the network environment is dynamic, and services in a composition may disappear or change. Furthermore, the composition requirement of a user may also vary. The composition plan should adjust accordingly. This paper proposes a repairing service composition approach based on a planning graph. We repair a solution from the last layer, then search backward for missing services. Return a repaired solution until a satisfactory result is obtained. To verify the effectiveness and efficiency of our approach, experiments are carried out compared with some repair methods and replanning approaches. Experimental results indicate that our approach has an average 5.05% higher chance of finding a solution compared to the original repair method.

Keywords: planning graph; repair service composition; web service.

DOI: 10.1504/IJWET.2024.143362

International Journal of Web Engineering and Technology, 2024 Vol.19 No.4, pp.421 - 442

Received: 03 Oct 2023
Accepted: 28 May 2024

Published online: 16 Dec 2024 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article