Searcharxiv⌕ Search

arXiv subjects

Oleksii S. Bychkov

Publications and source records attributed to Oleksii S. Bychkov.

2 recordsLinked to original sources

Formalization and quantitative metrics for functional stability of edge computing systems

Edge computing systems operate in conditions where component failures, intermittent backhaul connectivity, resource exhaustion and adversarial disturbances are part of the normal operating envelope rather than rare events. Classical reliability and fault-tolerance models, oriented toward monolithic systems and binary working/failed states, do not capture the differentiated quality requirements of services co-located on a resource-constrained edge node. This article proposes a formal framework of functional stability that shifts the unit of analysis from the system to the individual function. Strong and weak forms of stability are defined through a continuous quality function and per-function quality thresholds. A system of base parameters (disturbance tolerance, recovery time, degradation depth, admissible degradation) and aggregate metrics (cumulative quality, functional availability, integral stability) is introduced and connected to the formal definitions by nine theorems. The framework is instantiated for edge computing scenarios and illustrated through two analytical case studies: a UAV swarm and an edge AI inference service with cloud fallback. The proposed metrics distinguish architectural alternatives that classical availability cannot separate and expose the dependence of architectural ranking on the explicitly selected disturbance-class set.

cs.AR↗

Lyapunov-based analysis of functional stability for edge computing systems

Functional stability has been proposed as a per-function reliability concept for edge computing, in which the unit of analysis is the individual service rather than the whole system and the binary working/failed evaluation is replaced by a continuous quality function with per-function thresholds. Verifying these properties for a concrete edge orchestrator, migration policy, or distributed inference service requires a constructive method. This article connects functional stability to the direct Lyapunov method. The strong form is characterized through positive invariance of the admissible region; the weak form is connected to uniform ultimate boundedness and input-to-state stability with analytical recovery-time bounds. Switched dynamics from service migration and node failover are treated via common Lyapunov functions. Finite-horizon variants address mission-bounded edge workloads.

cs.AR↗