Cited by 23IoT and Edge/Fog ComputingSoftware System Performance and ReliabilityDistributed systems and fault tolerance

DeepFT: Fault-Tolerant Edge Computing using a Self-Supervised Deep Surrogate Model

Tuli, Shreshth, Casale, Giuliano, Cherkasova, Ludmila, Jennings, Nicholas R.·2023·IEEE INFOCOM 2023 - IEEE Conference on Computer Communications

Abstract

The emergence of latency-critical AI applications has been supported by the evolution of the edge computing paradigm. However, edge solutions are typically resource-constrained, posing reliability challenges due to heightened contention for compute capacities and faulty application behavior in the presence of overload conditions. Although a large amount of generated log data can be mined for fault prediction, labeling this data for training is a manual process and thus a limiting factor for automation. Due to this, many companies resort to unsupervised fault-tolerance models. Yet, failure models of this kind can incur a loss of accuracy when they need to adapt to non-stationary workloads and diverse host characteristics. Thus, we propose a novel modeling approach, DeepFT, to proactively avoid system overloads and their adverse effects by optimizing the task scheduling decisions. DeepFT uses a deep-surrogate model to accurately predict and diagnose faults in the system and co-simulation based self-supervised learning to dynamically adapt the model in volatile settings. Experimentation on an edge cluster shows that DeepFT can outperform state-of-the-art methods in fault-detection and QoS metrics. Specifically, DeepFT gives the highest F1 scores for fault-detection, reducing service deadline violations by up to 37% while also improving response time by up to 9%.

Integrity signals

Registry

Crossref · 10.1109/infocom53939.2023.10229049

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

The citation lists haven’t been fetched yet

References 47 · Cited by 23

Authors
Tuli, S., Casale, G., Cherkasova, L., & Jennings, N. R.
Affiliations
  • Imperial College London (GB)
  • ARM Research,USA
  • Loughborough University (GB)
Venue
IEEE INFOCOM 2023 - IEEE Conference on Computer Communications
Publisher
IEEE
Published
2023-05-17
Pages
1-10
OpenAlex
W4386243240
Cited by
23
References
47
Citations by year
2026: 8 · 2025: 6 · 2024: 7 · 2023: 2
FWCI
6.94
Type
conference paper
Language
en
Open access
closed
Locations
IEEE Conference on Computer Communications (INFOCOM) (publishedVersion)
Funders
Imperial College London
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed systems and fault tolerance
Keywords
fault tolerance, edge computing, self-supervised learning, fault prediction, task scheduling, co-simulation, quality of service, resource-constrained systems

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