JUST: Cost-efficient joint cluster upgrade sequencing and task scheduling for containerized edge computing

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Computer Networks Pub Date : 2026-03-01 Epub Date: 2026-01-29 DOI:10.1016/j.comnet.2026.112065
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 ,&nbsp;Xuan Xie ,&nbsp;Zhiqing Tang ,&nbsp;Wenmian Yang ,&nbsp;Jianxiong Guo ,&nbsp;Tian Wang ,&nbsp;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.
JUST:用于容器化边缘计算的经济高效的联合集群升级排序和任务调度
边缘计算(EC)的兴起导致在使用容器的边缘服务器上部署更多的应用程序,这些应用程序依赖于经常需要升级的多层映像文件。虽然这些升级是必要的,但由于资源限制、地理分布和延迟敏感性,传统的云升级策略不适合电子商务。因此,在EC中有效地更新容器是一项重大挑战。为了快速有效地解决电子商务系统的升级问题,本文提出了一种具有成本效益的在线分层联合集群升级排序和任务调度(JUST)算法。我们的JUST算法包括两个主要机制。首先,我们通过评估短期和长期节点升级成本以及任务优先级来建模边缘集群升级问题,建立集群升级排序机制以最大限度地减少对正在进行的任务的中断。其次,我们引入了一种层感知任务调度机制,通过优化层传输、下载和计算时间来减少初始调度和升级相关的重调度延迟。该方法通过强化学习和自适应分解网络集成节点资源、层分布和任务特征,最大限度地减少升级中断。最后,模拟和真实数据集的实验表明,我们的JUST算法优于基线方法,总延迟提高了47%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书