Scheduling and checkpointing optimization algorithm for Byzantine fault tolerance in cloud clusters

Abstract

Cloud Computing distinguishes itself from other distributed computing paradigm through offering services on-demand basis without any geographical restrictions. This revolutionizes the computing by offering services to wide array of customers starting from casual user to highly business oriented Industries. In spite of its capabilities, Cloud Computing still struggle with handling wide array of faults, this causes loss of credibility to Cloud Computing. Among those faults Byzantine faults offers serious challenge to fault tolerance mechanism, because it often go undetected at the initial stage and it can easily propagate to other VMs before a detection is made. Consequently some of the mission critical application such as air traffic control, online baking etc still staying away from the cloud for such reasons. However if a Byzantine faults is not detected and tolerated at initial stage then applications such as big data analytics can go completely wrong in spite of hours of computations performed by the entire cloud. Therefore in the previous work a fool-proof Byzantine fault detection has been proposed, as a continuation this work designs a scheduling algorithm (WSSS) and checkpoint optimization algorithm (TCC) to tolerate and eliminate the Byzantine faults before it makes any impact. The WSSS algorithm keeps track of server performance which is part of Virtual Clusters to help allocate best performing server to mission critical application. WSSS therefore ranks the servers based on a counter which monitors every Virtual Nodes (VN) for time and performance failures. The TCC algorithm works to generalize the possible Byzantine error prone region through monitoring delay variation to start new VNs with previous checkpointing. Moreover it can stretch the state interval for performing and error free VNs in an effect to minimize the space, time and cost overheads caused by checkpointing. The analysis is performed with plotting state transition and CloudSim based simulation. The result shows TCC reduces fault tolerance overhead exponentially and the WSSS allots virtual resources effectively.

Blockchain-based federated learning methodologies in smart environments

“…Blockchain uses different consensus algorithms for adding a block in a chain. The main idea behind consensus is to make all peers agree on [22], Byzantine Fault Tolerance algorithm [23], and the Ripple algorithm [24] are some famous consensus algorithms used in different application depending upon the requirements. Bitcoin uses the PoW consensus algorithm to add blocks in a chain.…”

Fault‐tolerant with load balancing scheduling in a fog‐based IoT application

“…Chinnathambi et al in [15] presented the FTS based on proactive and reactive models. Their algorithm selects the resources considering a load of the Cloud.…”

Analysis of Effective Load Balancing Techniques in Distributed Environment

“…Various researchers suggested numerous techniques for heterogeneous task allocation [21][22][23][24]. Adhikari et al [25] presented a task assignment mechanism that provides reduced makespan and execution cost in cloud environment.…”