Search arXivSearch

arXiv · 2608.21866

Reliability-Aware Scheduling for Digital Twin Maintenance

Abstract

In Industrial Internet of Things systems, learning-enabled Digital Twins (DTs) support remote monitoring by using data reported by distributed devices to maintain digital representations of physical processes. When uplink resources are limited, a base station cannot collect new observations from every device at every communication slot and must decide which devices should transmit. This decision becomes challenging when the physical process changes after the DT models have already been trained. In such cases, recent observations alone may not keep the DT accurate, because the learned model may no longer match the underlying process. This paper studies how to schedule observation requests so that the DT maintained at the base station remains close to the true physical process. We define the Ensemble Disagreement Indicator (EDI) as an uncertainty measure computed at the base station from the spread among estimates produced by independently trained DT predictors. Building on EDI, we propose R-VoU, a reliability-aware value-of-update scheduler that prioritizes the observations expected to most improve the DT by reducing a cost based on uncertainty and predicted DT error. The DT is further adjusted online using the difference between received observations and current predictions. Experiments on process manufacturing data show that, under limited communication budgets, R-VoU achieves the lowest combined cost and DT estimation error among the compared schedulers that use only information available before each scheduling decision.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milica Jankov, Carlo Fischione. 2026-08-22. Reliability-Aware Scheduling for Digital Twin Maintenance. https://arxiv.org/abs/2608.21866

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI

Pattern-Aware Virtual Network Embedding Optimization for Cloud Data Centers

The network virtualization (NV) technology has enabled the sharing of multiple resources among virtual networks (VNs) in cloud data centers. One of the key challenges is to allocate resources in real-time for virtual network request (VNR), which is known as online virtual network embedding (VNE). However, the existing online VNE methods do not exploit the multi-dimensional complementary relationship among diverse VNRs, resulting in the fragmentation and waste of substrate resources. In this paper, we propose the pattern matching based online VNE approach by constructing appropriate matching rules among observed patterns to maximize resources utilization. We devise the clustering based VNRs quantization method and conduct rigorous study on the pattern combination filtering problem. Then, we utilize the column generation to solve it and construct the pattern matching rules. Based on the rules, we propose an online pattern matching VNE algorithm with linear worst-case complexity. Evaluation on a 106-server testbed using Alibaba production cluster trace dataset shows that our algorithm achieves close-to-offline performance and more accepted workloads that outperforms traditional designs by 25%-30%.

cs.NI