Adaptive Data Replication in Real-Time Reliable Edge Computing for Internet of Things
Abstract
Many Internet-of-Things (IoT) applications rely on timely and reliable processing of data collected from embedded sensing devices. To achieve timely response, computing tasks are executed on IoT gateways at the edge of clouds, and for fault tolerance, the gateways perform data replication to backup gateways. In this paper, we report our study of data replication strategies and a real-time and fault-tolerant edge computing architecture for IoT applications. We first analyze how both embedded devices' storage constraints and data replication frequency may impose timing constraints on data replication tasks, and we investigate correlations between execution of data replication tasks and execution of edge computing tasks. Accordingly, we propose adaptive data replication strategies and introduce a framework for real-time reliable edge computing to meet the needed levels of data loss tolerance and timeliness. We have implemented our framework and empirically evaluated the proposed strategies with baseline approaches. We set up experiments using Industrial IoT traffic configurations that have requirements on data loss and timeliness, and our experimental results show that the proposed data replication strategies and framework can ensure needed levels of data loss tolerance, save network bandwidth consumption, while maintaining the latency performance.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
ARREC indicates CPU usage below 5%.
“ARREC [27] indicates CPU usage below 5%”
From Digital Twins at the Edge: A High-Availability Framework for Resilient Data Processing in IoT Sensor Networks (2026) · cites this paper as [27]
Cites
Edge computing: Vision and challenges
Shi, W., Cao, J., Zhang, Q., Li, Y., & Xu, L. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2579198 · Cited by 8,733 · see citing works
A Proof for the Queuing Formula: <i>L</i> = λ <i>W</i>
Little, J. D. C. (1961) · Operations Research · doi:10.1287/opre.9.3.383 · Cited by 2,777 · see citing works
Zaharia, M., Das, T., Li, H., Hunter, T., Shenker, S. J., & Stoica, I. G. (2013) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/2517349.2522737 · Cited by 987 · see citing works
The design and performance of a real-time CORBA event service
Harrison, T. H., Levine, D. L., & Schmidt, D. C. (1997) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/263698.263734 · Cited by 399 · see citing works
Budhiraja, N., Marzullo, K., Schneider, F. B., & Toueg, S. (1993) · Cited by 345 · see citing works
Venkataraman, S., Panda, A., Ousterhout, K., et al. (2017) · Symposium on Operating Systems Principles · doi:10.1145/3132747.3132750 · Cited by 145 · see citing works
Baker, T. P., Cirinei, M., & Bertogna, M. (2008) · Real-Time Systems · doi:10.1007/s11241-008-9061-6 · Cited by 66 · see citing works
On-line multiprocessor scheduling algorithms for real-time tasks
Lee, S. K. (2002) · doi:10.1109/tencon.1994.369148 · Cited by 57 · see citing works
Lightweight Asynchronous Snapshots for Distributed DataflowsPreprint
Carbone, P., Fóra, G., Ewen, S., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1506.08603 · Cited by 54 · see citing works
The design and performance of a real-time CORBA event service
Harrison, T. H., Levine, D. L., & Schmidt, D. C. (1997) · ACM SIGPLAN Notices · doi:10.1145/263700.263734 · Cited by 39 · see citing works
FRAME: Fault Tolerant and Real-Time Messaging for Edge Computing
Wang, C., Gill, C. D., & Lu, C. (2019) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2019.00101 · Cited by 22 · see citing works
Self-citationEDZL Schedulability Analysis in Real-Time Multicore Scheduling
Lee, J., & Shin, I. (2013) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2012.75 · Cited by 20 · see citing works
Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs
Babay, A., Wagner, E., Dinitz, M., et al. (2017) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2017.63 · Cited by 14 · see citing works
Recovery Time Considerations in Real-Time Systems Employing Software Fault Tolerance
Bhat, A., Samii, S., & Rajkumar, R. (2018) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ecrts.2018.23 · Cited by 8 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Neagu, M., Serban, C. M., Hangan, A., & Sebestyen, G. (2026) · Future Internet · doi:10.3390/fi18030137 · Cited by 3 · see citing works
- Authors
- Wang, C., Gill, C., & Lu, C.
- Affiliations
- National Taiwan Normal University (TW)
- Washington University in St. Louis (US)
- Venue
- 2020 IEEE/ACM Fifth International Conference on Internet-of-Things Design and Implementation (IoTDI)
- Publisher
- IEEE
- Published
- 2020-04
- Pages
- 128-134
- OpenAlex
- W3027334683
- Cited by
- 18
- References
- 14
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 2 · 2023: 2 · 2022: 6 · 2021: 6
- FWCI
- 2.94
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE/ACM International Conference on Internet-of-Things Design and Implementation (IoTDI) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
- Physical Sciences › Computer Science › Hardware and Architecture › Energy Efficiency in Computing
- Keywords
- data replication, edge computing, Internet of Things, fault tolerance, real-time systems, IoT gateway, timeliness, network bandwidth, Industrial Internet of Things, embedded devices
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
