Storage Placement in Computing Continuum for a Robotic Application
preprint
OA: closed
Abstract
This paper analyzes the timing performance of a persistent storage designed for distributed container-based architectures in industrial control applications. The storage ensures data availability and consistency while accommodating faults. The analysis considers four aspects: 1) placement strategy, 2) design options, 3) data size, and 4) evaluation under faulty conditions. Experimental results considering the timing constraints in industrial applications indicate that the storage solution can meet critical deadlines, particularly under specific failure patterns. Moreover, this evaluation method is applicable for assessing other container-based critical applications with timing constraints that require persistent storage.Further comparison results reveal that, while the method may underperform current centralized solutions under fault-free conditions, it outperforms the centralized solutions in failure scenarios.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00