Metraipolis › archive › dc_99d73de7ed79
Distributed Linear Bandits for Freshness-Aware Preprocessing in MEC-Enabled Digital Twin Networks — arXiv:2611.05115
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05115
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:34:52.503Z
- SHA-256 of the archived text
b1038e350a51f5c1d76a6bdf93994c400233f45a7a0a7df26ee8d209e8e349bc- Stable URL of this page
https://metraipolis.com/documento/dc_99d73de7ed79
How to cite
Distributed Linear Bandits for Freshness-Aware Preprocessing in MEC-Enabled Digital Twin Networks — arXiv:2611.05115 — arXiv (en), https://arxiv.org/abs/2611.05115 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99d73de7ed79 (Metraipolis archive dc_99d73de7ed79, sha256 b1038e350a51f5c1d76a6bdf93994c400233f45a7a0a7df26ee8d209e8e349bc)
BibTeX
@misc{dc99d73de7ed79,
title = {Distributed Linear Bandits for Freshness-Aware Preprocessing in MEC-Enabled Digital Twin Networks — arXiv:2611.05115},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05115},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99d73de7ed79; sha256 b1038e350a51f5c1d76a6bdf93994c400233f45a7a0a7df26ee8d209e8e349bc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05115. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Digital twins (DTs) require timely updates from Internet of Things (IoT) devices to accurately represent the state of the corresponding physical systems, but transmitting large data volumes can compromise freshness. Moreover, different task classes have distinct computational demands and freshness requirements, while stochastic task generation and sizes complicate resource allocation. In this paper, we propose a freshness-aware framework in which multi-access edge computing (MEC) servers preprocess IoT data, reducing transmission volume and DT-server processing load. The framework establishes mutual support between DT and MEC servers. The DTs determine feasible CPU-allocation strategies guaranteeing class-specific age-of-information (AoI) requirements under specified workload, delay, and update-generation bounds. MEC servers collaboratively identify the feasible strategy minimizing expected freshness-normalized preprocessing delay. We formulate CPU-strategy selection as a fixed-confidence distributed best-arm identification problem in linear bandits, with MEC servers as agents and CPU allocations across task classes as arms. We employ DistLinGapE, a distributed collaborative learning method, to coordinate exploration and share observations. Numerical results show that the method identifies the optimal feasible strategy and reduces preprocessing delay when deployed under stationary task-class assignments and workload statistics. Collaboration yields an identification speedup nearly proportional to the number of participating MEC servers in the evaluated settings. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2611.05115 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:27:17.015Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).