QoS-Constrained Service Selection for Networked Microservices

Abstract

In the microservice system, microservices are generally deployed as many microservice instances connected by a network system, and there are several composite services (CSs) in the system, each of which consists of several tasks that need to be executed on instances and has some Quality of Service (QoS) constraints to represent the user requirement for QoS. At runtime, it is necessary to select the microservice instance for each task under constraints and form an execution path of the CS. However, traditional service selection methods focus on the QoS optimization of a single CS, while ignoring sharing and competition of instances. To address this problem, this paper presents a Microservice Service Selection algorithm (MSS) based on list scheduling. Firstly, a workflow model is employed to describe the CS and to analyze the processing speed of instances, the transferring speed of the network and the degree of task concurrency, to calculate the sub-deadline of each task. Then, according to the sub-deadline and other information, the scheduling urgency of each task is calculated and updated in real-time. Finally, two service selection strategies based on the sub-deadline and urgency are proposed to complete the microservice instances selection and constitute the service path. Experiments have been carried out using the standard workflow examples of real-world applications. The results show that the proposed selection strategies can effectively improve the performance of service selection in network systems.

Keywords

• Distributed system
• microservice
• scheduling
• service selection