Dynamic Migration in Digital Twin-Enabled Industrial Internet: A Stochastic Network Calculus Approach

IF 5.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Rui Huang;Qingling Li;Liangru Xie;Fei Shang
{"title":"Dynamic Migration in Digital Twin-Enabled Industrial Internet: A Stochastic Network Calculus Approach","authors":"Rui Huang;Qingling Li;Liangru Xie;Fei Shang","doi":"10.1109/TNSM.2026.3665033","DOIUrl":null,"url":null,"abstract":"Digital Twin (DT) technology serves as a critical enabler in Cyber-Physical-Social Systems (CPSS), especially within Industry 5.0’s human-centric manufacturing paradigm. However, the computational intensity of processing real-time data in DT systems often leads to resource saturation and performance degradation at computation nodes. Dynamic service migration of digital twins by offloading computation-intensive tasks to resource-rich nodes to offer a promising solution, yet introduces challenges in preserving service quality during migration. Key issues include high delay, data inconsistency, service interruptions, and limited bandwidth compromising system stability. To address these challenges, this paper proposes a dynamic migration scheduling strategy for digital twins based on a Lyapunov optimization framework. Our approach integrates Stochastic Network Calculus (SNC) for Quality of Service (QoS) quantification and a persistent queue mechanism for reliability assurance. Theoretical analysis and extensive simulations demonstrate that the proposed algorithm achieves near-optimal performance with provable bounds, effectively minimizing migration-induced delay while maintaining service reliability. The results confirm that our framework consistently outperforms existing solutions in managing service migration within industrial internet systems.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"23 ","pages":"2778-2792"},"PeriodicalIF":5.7000,"publicationDate":"2026-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11397101/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Digital Twin (DT) technology serves as a critical enabler in Cyber-Physical-Social Systems (CPSS), especially within Industry 5.0’s human-centric manufacturing paradigm. However, the computational intensity of processing real-time data in DT systems often leads to resource saturation and performance degradation at computation nodes. Dynamic service migration of digital twins by offloading computation-intensive tasks to resource-rich nodes to offer a promising solution, yet introduces challenges in preserving service quality during migration. Key issues include high delay, data inconsistency, service interruptions, and limited bandwidth compromising system stability. To address these challenges, this paper proposes a dynamic migration scheduling strategy for digital twins based on a Lyapunov optimization framework. Our approach integrates Stochastic Network Calculus (SNC) for Quality of Service (QoS) quantification and a persistent queue mechanism for reliability assurance. Theoretical analysis and extensive simulations demonstrate that the proposed algorithm achieves near-optimal performance with provable bounds, effectively minimizing migration-induced delay while maintaining service reliability. The results confirm that our framework consistently outperforms existing solutions in managing service migration within industrial internet systems.
数字双机工业互联网的动态迁移:随机网络演算方法
数字孪生(DT)技术是网络-物理-社会系统(CPSS)的关键推动者,特别是在工业5.0以人为中心的制造范式中。然而,在DT系统中,处理实时数据的计算强度往往导致计算节点的资源饱和和性能下降。通过将计算密集型任务卸载到资源丰富的节点来实现数字孪生的动态服务迁移,提供了一个有前途的解决方案,但在迁移过程中引入了保持服务质量的挑战。关键问题包括高延迟、数据不一致、服务中断和影响系统稳定性的有限带宽。为了解决这些问题,本文提出了一种基于Lyapunov优化框架的数字孪生动态迁移调度策略。我们的方法集成了用于服务质量(QoS)量化的随机网络演算(SNC)和用于可靠性保证的持久队列机制。理论分析和大量仿真结果表明,该算法在可证明边界下实现了近乎最优的性能,在保持服务可靠性的同时有效地减少了迁移引起的延迟。结果证实,我们的框架在管理工业互联网系统内的服务迁移方面始终优于现有的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术官方微信
小红书