Dependency Mining for Service Resilience at the Edge
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Edge computing paradigm is prone to failures as it trades reliability against other quality of service properties such as low latency and geographical prevalence. Therefore, software services that run on edge infrastructure must rely on failure resilience techniques for uninterrupted delivery. Unique combination of hardware, software, and network characteristics of edge services is not addressed by existing techniques that are designed or tailored for cloud services. In this work, we propose a novel method for evaluating the resilience of replicated edge services, which exploits failure dependencies between edge servers to forecast probability of service interruption. This is done by analyzing historical failure logs of individual servers, modeling temporal dependencies as a dynamic Bayesian network, and inferring the probability that certain number of servers fail concurrently. Furthermore, we propose two replica scheduling algorithms that optimize different criteria in resilient service deployment, namely failure probability and cost of redundancy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The case for vm-based cloudlets in mobile computing
Satyanarayanan, M., Bahl, P., Caceres, R., & Davies, N. (2009) · IEEE Pervasive Computing · doi:10.1109/mprv.2009.82 · Cited by 3,660
The emergence of edge computing
Satyanarayanan, M. (2017) · Computer · doi:10.1109/mc.2017.9 · Cited by 2,832 · cited 2×
“values of computing power (represented with server icons) and average round-trip time (RTT) are evaluated based on literature [1], [2], [35].”
BackgroundMethodMobile edge computing, Fog et al.: A survey and analysis of security threats and challenges
Roman, R., Lopez, J., & Mambo, M. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2016.11.009 · Cited by 1,338 · cited 2×
“Although essential for its success, resilience in edge computing is still an open research area [15].”
BackgroundFog Computing: A Platform for Internet of Things and Analytics
Bonomi, F., Milito, R., Natarajan, P., & Zhu, J. (2014) · Studies in Computational Intelligence · doi:10.1007/978-3-319-05029-4_7 · Cited by 1,222 · cited 1×
“values of computing power (represented with server icons) and average round-trip time (RTT) are evaluated based on literature [1], [2], [35].”
MethodFinding your Way in the Fog: Towards a Comprehensive Definition of Fog Computing
Vaquero, L. M., & Rodero-Merino, L. (2014) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2677046.2677052 · Cited by 1,066
Learning Bayesian networks is NP-complete
Chickering, D. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_12 · Cited by 1,001
Edge-centric Computing: Vision and Challenges
Garcia Lopez, P., Montresor, A., Epema, D., Datta, A., Higashino, T., Iamnitchi, A., Barcellos, M., Felber, P., & Riviere, E. (2015) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2831347.2831354 · Cited by 934 · cited 1×
“) [33], [34] which results in significantly lower availability.”
BackgroundReal-Time Video Analytics: The Killer App for Edge Computing
Ananthanarayanan, G., Bahl, P., Bodik, P., Chintalapudi, K., Philipose, M., Ravindranath, L., & Sinha, S. (2017) · Computer · doi:10.1109/mc.2017.3641638 · Cited by 496 · cited 1×
“Once latency benefits of edge computing are complemented with failure resilience, many near real-time services such as live video analytics [10] and streaming [11], vehicular applications [12], [13], and smart city information systems [14] could be included to the cloud and edge computing ecosystem.”
BackgroundRecovery for overloaded mobile edge computing
Satria, D., Park, D., & Jo, M. (2017) · Future Generation Computer Systems · doi:10.1016/j.future.2016.06.024 · Cited by 112 · cited 1×
“Recently, a recovery scheme for edge computing failures is proposed in [54].”
BackgroundLow-Cost Video Transcoding at the Wireless Edge
Yoon, J., Liu, P., & Banerjee, S. (2016) · 2016 IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec.2016.8 · Cited by 21 · cited 1×
“Once latency benefits of edge computing are complemented with failure resilience, many near real-time services such as live video analytics [10] and streaming [11], vehicular applications [12], [13], and smart city information systems [14] could be included to the cloud and edge computing ecosystem.”
Background
Cited by
A Survey of Virtual Machine Management in Edge Computing
Tao, Z., Xia, Q., Hao, Z., Li, C., Ma, L., Yi, S., & Li, Q. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2927919 · Cited by 114
Learning Spatiotemporal Failure Dependencies for Resilient Edge Computing Services
Aral, A., & Brandic, I. (2021) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.3046188 · Cited by 68
“Previous work in the field of system reliability already showed a correlation between failures in various distributed computing systems [8], [9] including edge computing [10].”
BackgroundMethodProactive Fault Tolerant Service Management in Edge Computing
Tambe, S. D., & A., A. F. (2023) · 2023 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS) · doi:10.1109/ants59832.2023.10469661 · Cited by 2
“Also, if failure probability and the number of replicas are known in failure dependencies scenarios, authors proposed approaches for replica scheduling and evaluating the resiliency and failure forecast by modeling failure dependency using the dynamic Bayesian network in edge infrastructure in [15].”
Method
Metadata
- Authors
- Aral, A., & Brandic, I.
- Venue
- 2018 IEEE/ACM Symposium on Edge Computing (SEC)
- Publisher
- IEEE
- Published
- 2018-10
- Pages
- 228-242
- OpenAlex
- W2904385286
- Cited by
- 39
- References
- 10
- FWCI
- 4.59
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dependency Mining for Service Resilience at the Edge. https://app.cochat.ai/papers/10.1109/sec.2018.00024
- The paper
- Aral, A., & Brandic, I. (2018). Dependency Mining for Service Resilience at the Edge. 2018 IEEE/ACM Symposium on Edge Computing (SEC). https://doi.org/10.1109/sec.2018.00024
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.