Resilience Modeling in Distributed Systems Based on the Generalized Erdős – Rényi Model and the Gilbert – Elliott Model

The aim of this study is to develop and validate a model for assessing the resilience of distributed systems that considers both the structural characteristics of the network and the dynamic behavior of connections. The proposed model combines graph analysis (based on the Erdős – Rényi model) and statistical modeling (Gilbert – Elliott model), integrating connectivity probabilities and successful connection metrics to evaluate network resilience. The primary objective was to create an approach capable of accurately describing real-world network processes and identifying potential points of degradation. The model was tested using a local Kubernetes cluster, where a test CRUD service was deployed under load for 24 hours. Collected metrics, including packet loss, latency, and throughput, were compared to the model’s predictions. The results showed minimal deviations between theoretical predictions and empirical data, confirming the model’s adequacy. The study concludes that the proposed approach can not only accurately describe current network processes but also serve as a foundation for decision-making regarding scaling and replication. The model’s flexibility ensures its relevance in scenarios involving changes in network topology or connection quality, making it applicable for analyzing modern distributed systems.

Authors

Institutions

Publication Details

Journal
Computational nanotechnology
Published
2025-05-27
DOI
https://doi.org/10.33693/2313-223x-2025-12-1-79-88
Citations
1
Primary Topic
Multi-Criteria Decision Making
Type
article
Field-Weighted Citation Impact
2.11
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resilience Modeling in Distributed Systems Based on the Generalized Erdős – Rényi Model and the Gilbert – Elliott Model

D. I. Sukhoplyuev, Alexey Nazarov
1 citations
Computational nanotechnology
Multi-Criteria Decision Making
2.11
article

Resilience Modeling in Distributed Systems Based on the Generalized Erdős – Rényi Model and the Gilbert – Elliott Model

D. I. Sukhoplyuev, Alexey Nazarov
article en
1 citations

Abstract

The aim of this study is to develop and validate a model for assessing the resilience of distributed systems that considers both the structural characteristics of the network and the dynamic behavior of connections. The proposed model combines graph analysis (based on the Erdős – Rényi model) and statistical modeling (Gilbert – Elliott model), integrating connectivity probabilities and successful connection metrics to evaluate network resilience. The primary objective was to create an approach capable of accurately describing real-world network processes and identifying potential points of degradation. The model was tested using a local Kubernetes cluster, where a test CRUD service was deployed under load for 24 hours. Collected metrics, including packet loss, latency, and throughput, were compared to the model’s predictions. The results showed minimal deviations between theoretical predictions and empirical data, confirming the model’s adequacy. The study concludes that the proposed approach can not only accurately describe current network processes but also serve as a foundation for decision-making regarding scaling and replication. The model’s flexibility ensures its relevance in scenarios involving changes in network topology or connection quality, making it applicable for analyzing modern distributed systems.

Computational nanotechnologyVol. 12(1)
Russian Academy of Sciences (RU), MIREA - Russian Technological University (RU)
Openalex Percentile: Top 13%
Multi-Criteria Decision Making
2.11
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.