.png){kind=icon}
.png){kind=icon}
Return
Efficient Container Assignment and Layer Sequencing in Edge Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TSC.2022.3159728.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Containers are becoming a popular way of running applications in edge computing. Before running the application, the edge node must download the application's container image consisting of multiple layers. However, given the limited bandwidth in edge computing, the container startup latency due to long image download time seriously affects the real-time performance. In this article, we jointly determine the container assignment and the layer download sequence to reduce the total startup latency. We formulate the Container Assignment and Layer Sequencing (CALS) problem and prove its NP-hardness. A Layer-Aware Scheduling Algorithm (LASA) is proposed, fully considering layer sharing among images. First, layers shared by the same set of images are grouped to reduce CALS's problem scale without affecting the optimal result. Second, considering both layer sharing and existing layer size on edge nodes, a layer-aware algorithm is designed to assign containers to appropriate edge nodes. Finally, to determine the layer download sequence on each edge node, an approximation algorithm is proposed. We further analyze the approximation ratio of LASA in the case of identical edge nodes with sufficient capacity. Extensive experiments based on real-world data show the effectiveness of LASA, which reduces the total startup latency by 40% to 60%.
Keywords:
Container scheduling
container startup
edge computing
layer sharing
Journal
IF:
5.8
Papers:
2.1K
Citations:
6.5K
Organization
View more organizations