Repairing a Service Composition with Graph Embedding and Planning Graph in a Cloud-Edge Environment

In order to keep up with the ever-changing world of services, it is essential to fix a broken service composition in a cloud-edge environment when it fails or when users' requests change. However, current methods for replanning or repairing a service composition need to take a while to generate a newsolution. To address this issue, we propose using a damaged planning graph repairing approach with graph embeddings to repair broken service compositions in the cloud-edge environment. To begin with, our approach employs graph embedding to acquire the low-dimensional vectors of service nodes within the service network graph. Secondly, we compute the candidate service set by utilizing the failed service, its parameters, and the user's initial input through graph embedding. Thirdly, we design an approach for repairing service compositions in a cloud-edge environment by relying on the candidate service set and the damaged planning graph. To verify the validity of the proposed approach, we analyze and compare the performances of the certain proposed method with referencing re-planning and repair methods, and the proposed method may repair a service composition within a shorter time.