MkRP: multiple k registry placement for fast container deployment on edge computing

Edge computing reduces the response time of real-time services with handling dynamic traffic reliably. Edge servers with limited resources often utilize container technology, which provides a lightweight execution environment. When deploying containers on edge servers, a container image is required and it is predominantly downloaded from a remote registry. Therefore, these operations are heavily influenced by network overhead between the container deployment system and the remote registry. Through motivation experiments specifically designed to identify these network overheads, we demonstrate that container pulling time increases in proportion to the physical distance between two hosts and varies flexibly based on runtime conditions. In this paper, we define a system model to place multiple registries for high-speed container deployment and propose a technique for clustering edge servers and selecting leaders within each cluster based on the affinity between edge servers and network overhead. We also propose a method for selectively deploying registries based on the idle resources of edge servers. We validate the proposed technique through simulation experiments. The results show consistent performance improvements regardless of the edge server count or the k value.

Authors

Institutions

Publication Details

Journal
Journal of Cloud Computing Advances Systems and Applications
Published
2025-11-03
DOI
https://doi.org/10.1186/s13677-025-00791-4
Citations
1
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MkRP: multiple k registry placement for fast container deployment on edge computing

Heonchang Yu, Rubén Titos-Gil, Chunggeon Song
1 citations
Journal of Cloud Computing Advances Systems and Applications
IoT and Edge/Fog Computing
1.49
article

MkRP: multiple k registry placement for fast container deployment on edge computing

Heonchang Yu, Rubén Titos-Gil, Chunggeon Song
article en
1 citations

Abstract

Edge computing reduces the response time of real-time services with handling dynamic traffic reliably. Edge servers with limited resources often utilize container technology, which provides a lightweight execution environment. When deploying containers on edge servers, a container image is required and it is predominantly downloaded from a remote registry. Therefore, these operations are heavily influenced by network overhead between the container deployment system and the remote registry. Through motivation experiments specifically designed to identify these network overheads, we demonstrate that container pulling time increases in proportion to the physical distance between two hosts and varies flexibly based on runtime conditions. In this paper, we define a system model to place multiple registries for high-speed container deployment and propose a technique for clustering edge servers and selecting leaders within each cluster based on the affinity between edge servers and network overhead. We also propose a method for selectively deploying registries based on the idle resources of edge servers. We validate the proposed technique through simulation experiments. The results show consistent performance improvements regardless of the edge server count or the k value.

Journal of Cloud Computing Advances Systems and ApplicationsVol. 14(1)
Korea University (KR), Korea University (JP), Jeju National University (KR)
Ministry of Education, India
Openalex Percentile: Top 12%
IoT and Edge/Fog Computing
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.