AoI-Aware Service Provisioning in Edge Computing for Digital Twin Network Slicing Requests

Digital twins are poised to enter our lives with Industry 4.0. The Digital Twin Network (DTN) paradigm is projected to deliver upon the promise of efficient collaboration among digital twins to enable complicated and systematic services across many domains, through depicting an overall picture of a group of physical objects. To achieve timely data processing of digital twins, Mobile Edge Computing (MEC) shifts the computational power towards the network edge, and network slicing is well-suited to bundle heterogeneous physical resources to build logical networks based on edge servers for accommodating DTNs. In light of this, in this paper we investigate DTN slicing-enabled service provisioning in MEC, where each DTN slice consists of one master digital twin and a set of worker digital twins, and each worker digital twin is synchronized through collecting data from a respective object periodically. The master digital twin aggregates the processed data from worker digital twins to model the DTN continuously for user query services, whilst meeting delay requirements of users. We capture the utility gain of a DTN slicing request based on the DTN model quality at its master digital twin that is impacted by the Age of Information (AoI), and we focus on two novel optimization problems: the utility maximization problem for a single DTN slicing request, and the dynamic utility maximization problem for multiple DTN slicing requests. We propose an approximation algorithm for the former, and an online algorithm with a provable competitive ratio for the latter. We also evaluate the performance of the proposed algorithms through simulations. Experimental results demonstrate that the proposed algorithms are promising, outperforming their counterparts by at least 10.2%.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Mobile Computing
Published
2024-08-26
DOI
https://doi.org/10.1109/tmc.2024.3449818
Citations
14
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
4.88

Funders

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

AoI-Aware Service Provisioning in Edge Computing for Digital Twin Network Slicing Requests

Song Guo, Zichuan Xu, Zicong Hong, Weifa Liang et al.
14 citations
IEEE Transactions on Mobile Computing
IoT and Edge/Fog Computing
4.88
article

AoI-Aware Service Provisioning in Edge Computing for Digital Twin Network Slicing Requests

Song Guo, Zichuan Xu, Zicong Hong, Weifa Liang, Wenzheng Xu, Jing Li, Jianping Wang, Bin Xiao, Quan Chen
article en
14 citations

Abstract

Digital twins are poised to enter our lives with Industry 4.0. The Digital Twin Network (DTN) paradigm is projected to deliver upon the promise of efficient collaboration among digital twins to enable complicated and systematic services across many domains, through depicting an overall picture of a group of physical objects. To achieve timely data processing of digital twins, Mobile Edge Computing (MEC) shifts the computational power towards the network edge, and network slicing is well-suited to bundle heterogeneous physical resources to build logical networks based on edge servers for accommodating DTNs. In light of this, in this paper we investigate DTN slicing-enabled service provisioning in MEC, where each DTN slice consists of one master digital twin and a set of worker digital twins, and each worker digital twin is synchronized through collecting data from a respective object periodically. The master digital twin aggregates the processed data from worker digital twins to model the DTN continuously for user query services, whilst meeting delay requirements of users. We capture the utility gain of a DTN slicing request based on the DTN model quality at its master digital twin that is impacted by the Age of Information (AoI), and we focus on two novel optimization problems: the utility maximization problem for a single DTN slicing request, and the dynamic utility maximization problem for multiple DTN slicing requests. We propose an approximation algorithm for the former, and an online algorithm with a provable competitive ratio for the latter. We also evaluate the performance of the proposed algorithms through simulations. Experimental results demonstrate that the proposed algorithms are promising, outperforming their counterparts by at least 10.2%.

IEEE Transactions on Mobile ComputingVol. 23(12)
Guangdong University of Technology (CN), Hong Kong Polytechnic University (HK), City University of Hong Kong (HK), Hong Kong University of Science and Technology (HK), Sichuan University (CN), Dalian University of Technology (CN), Chengdu University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Shandong Province, Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 4%
IoT and Edge/Fog Computing
4.88
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.