Walking on two legs: Joint service placement and computation configuration for provisioning containerized services at edges

Abstract

With the development of edge computing and container virtualization, provisioning containerized services at network edges is proposed for high responsiveness and low wide area network (WAN) traffic. However, realizing its full potential faces multiple challenges. First, due to containers’ fine-grained computation resource isolation, finely configuring services’ computation resource requirements is needed, especially for resource-constrained edge nodes. Second, due to edges’ heterogeneity and services’ diversity, system performance highly depends on which edge node to place each service. Third, as the main metric of quality of service, service response time involves the computing-network delay tradeoff and urges to optimize the decisions jointly. Prior works on edge-enabled service placement either ignore computation resource isolation and configuration, or assume computation resource configuration is given manually. To fill this gap, this paper investigates the joint service placement and computation configuration problem for provisioning containerized services at edges. Then based on the convex and submodular optimization techniques, we propose a two-stage greedy and local-search combined algorithm, TeLa for short. Rigorous theoretical analyses demonstrate that TeLa is a polynomial-time algorithm with performance guarantees. Finally, we implement twelve containerized services and an edge computing prototype to realistically evaluate TeLa. The results confirm TeLa’s empirical superiority over state-of-the-art algorithms, in terms of 39% on average reduction on the weighted sum of service response time and WAN traffic.