On Evaluating Self-Adaptive and Self-Healing Systems using Chaos Engineering

Naqvi, Moeen Ali; Malik, Sehrish; Astekin, Merve; Moonen, Leon

doi:10.1109/acsos55765.2022.00018

Cited by 9 publications

(6 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A decision is acceptable only when all non-faulty components are agreed on it. The Byzantine Fault Tolerant (BFT) problem is a popular consensus algorithm that was introduced in the last quartile of the previous century [1] to solve '2 general problems' and it is becomes famous of its implementation in 4-way handshaking communication system of the client server architecture. Global services of the world are active 24 hours to assist the requests of the clients form any corner of the world even when one or more faulty components exists in the system, we called this reliable services and the system is known as fault-tolerant system.…”

Section: Implementation Of a Consensus Algorithmmentioning

confidence: 99%

“…A Byzantine faulty device leads to take wrong actions and a serious damage is the consequence of a wrong decision for any automated IoT platform. Hardware and software flaws, deployment errors, power outages, resource constraint characteristics, network disruption, small batteries are common causes for IoT device failure in addition of environmental conditions and collisions [1] which are considered to design BBFT algorithm. A typical IoT infrastructure consists of sensors, actuators, internet gateways, edge computing systems, cloud computing systems, cloud data centers, data analytic systems, and its platforms.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Sarker

2024

Preprint

View full text Add to dashboard Cite

Nowadays consensus algorithms are the backbone of fault tolerant systems, communication protocols, and distributed blockchain services though it is initiated to ensure reliable service in the presence of Byzantine faults of a distributed infrastructure. Real time automation system is highly depended on the reliability of IoT devices which are lightweight resource constrained components that demands a computationally faster algorithm within minimum number of steps. This research proposed a Boolean Byzantine Fault Tolerant (BBFT) algorithm that completes a consensus process by 3 steps only. It makes consensus by bitwise logical operations where all nodes get same decision after steps 3. It is proposed for static and predefined nodes of an agreement system that can detect malicious and anomaly nodes at the earlier stage than existing Byzantine Fault Tolerant (BFT) algorithms. BBFT is designed for resource constrained (limited memory and processing power) IoT devices where limited number of similar nodes can make an agreement. Boolean operations of the algorithm make it simple, easier for mathematical modeling, and suitable to express by vector notations of quantum computing applications. Though time complexity (O(n) = n2) of the BBFT is same as other classical BFT algorithms, it saves resources and reduces information processing delay due to the implementation of Boolean operations.

show abstract

Section: Implementation Of a Consensus Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Boolean Byzantine Fault Tolerant Algorithm for Light Weight IoT Consensus

Sarker

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…The evaluation of self-adaptive and self-healing systems is an important aspect of their design and deployment. In our previous work [6], we defined the evaluation of self-adaptive and self-healing systems as "an approach to determine if a system meets objectives under operation, identify areas in which the system performs as well as desired or predicted, and provide evidence to the value and applicability of the system. "…”

Section: B Evaluation Of Sas and Shs Based On Chaos Engineeringmentioning

confidence: 99%

“…To fill this gap, our earlier work proposed CHESS, an approach for the systematic evaluation of self-adaptive and self-healing systems that build on chaos engineering princi-ples [6]. CHESS systematically perturbates the system-underevaluation and records how the system responds to those perturbations.…”

Section: Introductionmentioning

confidence: 99%

CHESS: A Framework for Evaluation of Self-adaptive Systems based on Chaos Engineering

Malik,

Moonen

2023

View full text Add to dashboard Cite

There is an increasing need to assess the correct behavior of self-adaptive and self-healing systems due to their adoption in critical and highly dynamic environments. However, there is a lack of systematic evaluation methods for self-adaptive and self-healing systems. We proposed CHESS, a novel approach to address this gap by evaluating self-adaptive and self-healing systems through fault injection based on chaos engineering (CE).The artifact presented in this paper provides an extensive overview of the use of CHESS through two microservice-based case studies: a smart office case study and an existing demo application called Yelb. It comes with a managing system service, a self-monitoring service, as well as five fault injection scenarios covering infrastructure faults and functional faults. Each of these components can be easily extended or replaced to adopt the CHESS approach to a new case study, help explore its promises and limitations, and identify directions for future research.

show abstract

“…To fill this gap, our earlier work proposed CHESS, an approach for the systematic evaluation of self-adaptive and self-healing systems that build on chaos engineering principles [6]. CHESS systematically perturbates the system-underevaluation and records how the system responds to those perturbations.…”

Section: Introductionmentioning

confidence: 99%