Implementation of Fault Tolerance Algorithm to Restore Affected Nodes in Scheduling Clusters

Due to the convergence of the networks, the top priority objective of researchers is to get the network fully connected. Several types of networks have been introduced and proposed to improve performance. Cluster environment provides full support for various applications. Scheduling is one of the most important research-focusing areas, where different supporting algorithms are implemented. However, there is still a gap in scheduling to provide best network connectivity to all nodes. This paper targets nodes affected issue that occurs due to scalability, data sharing, while leaving and joining the nodes. To control and retain an affected node in the clustering scheduling, fault tolerance techniques are applied. The base of this technique is Node Recovery Algorithm (NRA). This algorithm supports disconnected nodes and restores them to join the scheduling. Furthermore, this algorithm maximizes the efficiency of the cluster and improves the performance