4.7 Article

Distributed Redundant Placement for Microservice-based Applications at the Edge

Journal

IEEE TRANSACTIONS ON SERVICES COMPUTING
Volume 15, Issue 3, Pages 1732-1745

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TSC.2020.3013600

Keywords

Redundancy; Containers; Mobile handsets; Cloud computing; Numerical models; Stochastic processes; Edge computing; Redundancy; service placement; multi-access edge computing; composite service; sample average approximation

Funding

  1. National Key Research and Development Program of China [2017YFB1400601]
  2. Key Research and Development Project of Zhejiang Province [2017C01015]
  3. National Science Foundation of China [61772461]
  4. Natural Science Foundation of Zhejiang Province [LR18F020003, LY17F020014]

Ask authors/readers for more resources

Multi-access edge computing (MEC) is a promising paradigm that pushes computation and communication resources to the network edge. We propose a distributed redundant placement framework and a GA-based Server Selection (GASS) algorithm for microservice-based applications. Numerical results based on real-world dataset confirm the superiority of our proposed approach over benchmark policies.
Multi-access edge computing (MEC) is booming as a promising paradigm to push the computation and communication resources from cloud to the network edge to provide services and to perform computations. With container technologies, mobile devices with small memory footprint can run composite microservice-based applications without time-consuming backbone. Service placement at the edge is of importance to put MEC from theory into practice. However, current state-of-the-art research does not sufficiently take the composite property of services into consideration. Besides, although Kubernetes has certain abilities to heal container failures, high availability cannot be ensured due to heterogeneity and variability of edge sites. To deal with these problems, we propose a distributed redundant placement framework SAA-RP and a GA-based Server Selection (GASS) algorithm for microservice-based applications with sequential combinatorial structure. We formulate a stochastic optimization problem with the uncertainty of microservice request considered, and then decide for each microservice, how it should be deployed and with how many instances as well as on which edge sites to place them. Benchmark policies are implemented in two scenarios, where redundancy is allowed and not, respectively. Numerical results based on a real-world dataset verify that GASS significantly outperforms all the benchmark policies.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available