A Hierarchical Approach for QoS-Aware Edge Service Scheduling and Composition

Abstract

Edge computing is a new computing paradigm after cloud computing. Edge service scheduling and composition (ESC) has been well recognized as a convenient and flexible way of services sharing and integrating in industrial application fields. The ESC aims at selecting a set of existing edge service candidates with different Quality of Service (QoS) attributes (e.g., price), then compositing them to accomplish a complex task to meet users' QoS requirements, where each edge service may have multiple functionally equivalent, but different QoS metrics. A grand research challenge of the ESC based on QoS is to select proper service candidates to maximize QoS of the composited edge service and meanwhile meet the global QoS requirements. In this article, we focus on this challenge and propose a hierarchical solution for ESC. Specifically, we classify service candidates into specified grades based on their QoS attributes, and use hierarchical model to address service selection problem. Furthermore, in order to expand the flexibility of our approach, we design a near-optimal solution by decomposing the global end-to-end QoS constraints into local QoS constraints and adopting local service selecting and updating strategy based on the hierarchical model. The results of simulation-based experiments are conducted to show our approach is more efficient and valid compared to other existing approaches.