Yuting Hu , Xuan Xie , Zhiqing Tang , Wenmian Yang , Jianxiong Guo , Tian Wang , Weijia Jia
{"title":"JUST: Cost-efficient joint cluster upgrade sequencing and task scheduling for containerized edge computing","authors":"Yuting Hu , Xuan Xie , Zhiqing Tang , Wenmian Yang , Jianxiong Guo , Tian Wang , Weijia Jia","doi":"10.1016/j.comnet.2026.112065","DOIUrl":null,"url":null,"abstract":"<div><div>The rise of Edge Computing (EC) has led to an increased deployment of applications on edge servers using containers, which rely on multi-layer image files that often need to be upgraded. While these upgrades are essential, traditional cloud upgrade strategies are not suitable for EC due to resource constraints, geographical distribution, and latency sensitivity. Consequently, efficiently updating containers in EC is a significant challenge. In this paper, we present the online layer-aware cost-efficient <u>J</u>oint cluster <u>U</u>pgrade <u>S</u>equencing and <u>T</u>ask scheduling (JUST) algorithm to quickly and efficiently address the upgrades in EC. Our JUST algorithm comprises two main mechanisms. First, we model the edge cluster upgrade problem by evaluating both short-term and long-term node upgrade costs along with task priorities, establishing a cluster upgrade sequencing mechanism to minimize disruptions to ongoing tasks. Second, we introduce a layer-aware task scheduling mechanism that reduces initial scheduling and upgrade-related rescheduling latency by optimizing layer transmission, downloads, and computation time. This approach minimizes upgrade disruptions by integrating node resources, layer distribution, and task characteristics through reinforcement learning and adaptive factorization networks. Finally, experiments with simulated and real datasets show that our JUST algorithm outperforms baseline methods, achieving a 47% improvement in total latency.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112065"},"PeriodicalIF":4.7000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128626000770","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/29 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
The rise of Edge Computing (EC) has led to an increased deployment of applications on edge servers using containers, which rely on multi-layer image files that often need to be upgraded. While these upgrades are essential, traditional cloud upgrade strategies are not suitable for EC due to resource constraints, geographical distribution, and latency sensitivity. Consequently, efficiently updating containers in EC is a significant challenge. In this paper, we present the online layer-aware cost-efficient Joint cluster Upgrade Sequencing and Task scheduling (JUST) algorithm to quickly and efficiently address the upgrades in EC. Our JUST algorithm comprises two main mechanisms. First, we model the edge cluster upgrade problem by evaluating both short-term and long-term node upgrade costs along with task priorities, establishing a cluster upgrade sequencing mechanism to minimize disruptions to ongoing tasks. Second, we introduce a layer-aware task scheduling mechanism that reduces initial scheduling and upgrade-related rescheduling latency by optimizing layer transmission, downloads, and computation time. This approach minimizes upgrade disruptions by integrating node resources, layer distribution, and task characteristics through reinforcement learning and adaptive factorization networks. Finally, experiments with simulated and real datasets show that our JUST algorithm outperforms baseline methods, achieving a 47% improvement in total latency.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.