Arsentii Prymushko

Mr. Arsentii Prymushko

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 January 2025 in IoT
Verified
Journal Article
Open access
PDF file
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
DSDmytro Sinko
Dmytro Sinko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
Modern electrical grids are evolving towards distributed architectures, necessitating efficient and reliable state synchronization mechanisms to maintain structural and functional consistency. This paper investigates the application of conflict-free replicated data types (CRDTs) for representing and synchronizing the states of distributed electrical grid systems (DEGSs). We present a general structure for DEGSs based on CRDTs, focusing on the Convergent Replicated Data Type (CvRDT) model with delta state propagation to optimize the communication overhead. The Observed Remove Set (ORSet) and Last-Writer-Wins Register (LWW-Register) are utilized to handle concurrent updates and ensure that only the most recent state changes are retained. An actor-based framework, “Vigilant Hawk”, leveraging the Akka toolkit, was developed to simulate the asynchronous and concurrent nature of DEGSs. Each electrical grid node is modelled as an independent actor with isolated state management, facilitating scalability and fault tolerance. Through a series of experiments involving 100 nodes under varying latency degradation coefficients (LDK), we examined the impact of network conditions on the state synchronization efficiency. The simulation results demonstrate that CRDTs effectively maintain consistency and deterministic behavior in DEGSs, even with increased network latency and node disturbances. An effective LDK range was identified (LDK effective = 2 or 4), where the network remains stable without significant delays in state propagation. The linear relationship between the full state distribution time (FSDT) and LDK indicates that the system can scale horizontally without introducing complex communication overhead. The findings affirm that using CRDTs for state synchronization enhances the resilience and operational efficiency of distributed electrical grids. The deterministic and conflict-free properties of CRDTs eliminate the need for complex concurrency control mechanisms, making them suitable for real-time monitoring and control applications. Future work will focus on addressing identified limitations, such as optimizing message routing based on the network topology and incorporating security measures to protect state information in critical infrastructure systems.

20 July 2025 in Digital
Verified
Journal Article
Open access
PDF file
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
IPIvan Puchko
Ivan Puchko
APArsentii Prymushko
Arsentii Prymushko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
An Application Programming Interface (API) is a formally defined interface that enables controlled interaction between software components, and is a key pillar of modern microservice-based architectures. However, asynchronous API changes often lead to breaking compatibility and introduce systemic instability across dependent services. Prior research has explored various strategies to manage such evolution, including contract-based testing, semantic versioning, and continuous deployment safeguards. Nevertheless, a comprehensive orchestration mechanism that formalizes dependency propagation and automates compatibility enforcement remains lacking. In this study, we propose a Compatibility-Driven Version Orchestrator, integrating semantic versioning, contract testing, and CI triggers into a unified framework. We empirically validate the approach on a Kubernetes-based environment, demonstrating the improved resilience of microservice systems to breaking changes. This contribution advances the theoretical modeling of cascading failures in microservices, while providing developers and DevOps teams with a practical toolset to improve service stability in dynamic, distributed environments.

21 May 2025 in Journal of Edge Computing
Verified
Journal Article
Open access
PDF file
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
OSOleksii Sirotkin
Oleksii Sirotkin
DSDmytro Sinko
Dmytro Sinko
The article addresses big data processing challenges, fault tolerance, and consumer interaction in a smart grid network management system. It analyses the use of Akka for agent-based modelling of smart grid systems, which enables the creation of distributed, resilient systems that can efficiently scale and recover from failures. The article describes how the hierarchical structure of Akka actors can improve the management of disparate components within a smart grid system, allowing developers to create complex interaction and management models. The approach ensures multithreading and asynchronous operation, geographic distribution of management nodes, and enhanced system security, allowing the simulation of system hierarchy down to the level of the end device or user, which is crucial for overall system reliability.

26 April 2025 in Computation
Verified
Journal Article
Open access
PDF file
OSOleksii Sirotkin
Oleksii Sirotkin
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
Modern computational models tend to become more and more complex, especially in fields like computational biology, physical modeling, social simulation, and others. With the increasing complexity of simulations, modern computational architectures demand efficient parallel execution strategies. This paper proposes a novel approach leveraging the reactive stream paradigm as a general-purpose synchronization protocol for parallel simulation. We introduce a method to construct simulation graphs from predefined transition functions, ensuring modularity and reusability. Additionally, we outline strategies for graph optimization and interactive simulation through push and pull patterns. The resulting computational graph, implemented using reactive streams, offers a scalable framework for parallel computation. Through theoretical analysis and practical implementation, we demonstrate the feasibility of this approach, highlighting its advantages over traditional parallel simulation methods. Finally, we discuss future challenges, including automatic graph construction, fault tolerance, and optimization strategies, as key areas for further research.

21 April 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
OSOleksii Sirotkin
Oleksii Sirotkin
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
Modern computational models tend to become more and more complex, especially in fields like computational biology, physical modelling, social simulation and others. With the increasing complexity of simulations, modern computational architectures demand efficient parallel execution strategies. This paper proposes a novel approach leveraging the reactive streams paradigm as a general-purpose synchronization protocol for parallel simulation. We introduce a method to construct simulation graphs from predefined transition functions, ensuring modularity and reusability. Additionally, we outline strategies for graph optimization and interactive simulation through push and pull patterns. The resulting computational graph, implemented using reactive streams, offers a scalable framework for parallel computation. Through theoretical analysis and practical implementation, we demonstrate the feasibility of this approach, highlighting its advantages over traditional parallel simulation methods. Finally, we discuss future challenges, including automatic graph construction, fault tolerance, and optimization strategies, as key areas for further research.

5 December 2024 in Preprints.org
Verified
Preprint
Open access
PDF file
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
DSDmytro Sinko
Dmytro Sinko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
Modern electrical grids are evolving towards distributed architectures, necessitating efficient and reliable state synchronization mechanisms to maintain structural and functional consistency. This paper investigates the application of Conflict-Free Replicated Data Types (CRDTs) for representing and synchronizing the states of Distributed Electrical Grid Systems (DEGS). We present a general structure for DEGS based on CRDTs, focusing on the Convergent Replicated Data Type (CvRDT) model with delta state propagation to optimize communication overhead. The Observed-Remove Set (ORSet) and Last-Writer-Wins Register (LWW-Register) are utilized to handle concurrent updates and ensure that only the most recent state changes are retained. An actor-based framework, "Vigilant Hawk," leveraging the Akka toolkit, was developed to simulate the asynchronous and concurrent nature of DEGS. Each electrical grid node is modeled as an independent actor with isolated state management, facilitating scalability and fault tolerance. Through a series of experiments involving 100 nodes under varying latency degradation coefficients (LDK), we examined the impact of network conditions on state synchronization efficiency. The simulation results demonstrate that CRDTs effectively maintain consistency and deterministic behavior in DEGS, even with increased network latency and node disturbances. An effective LDK range was identified (LDK effective=2,4), where the network remains stable without significant delays in state propagation. The linear relationship between the full state distribution time (FSDT) and LDK indicates that the system can scale horizontally without introducing complex communication overhead. The findings affirm that using CRDTs for state synchronization enhances the resilience and operational efficiency of distributed electrical grids. The deterministic and conflict-free properties of CRDTs eliminate the need for complex concurrency control mechanisms, making them suitable for real-time monitoring and control applications. Future work will focus on addressing identified limitations, such as optimizing message routing based on network topology and incorporating security measures to protect state information in critical infrastructure systems.