PERISHABLE SNAPSHOT-BASED MINIMUMPROCESS DEPENDABLE RECOVERY LINE ACCUMULATION PROTOCOL FOR MOBILE DISTRIBUTED SYSTEMS

We design a minimum process dependable recovery line accumulation (DRLaccumulation) algorithm for Mobile Distributed systems, where no useless checkpoints (reclamation-dots) are saved and an effort has been made to optimize the intrusion of operations. We propose to delay the processing of selective application-messages at the receiver end only during the DRL-accumulation period. An operation is allowed to perform its normal computations and send application-messages during its intrusion period. In this way, we try to keep intrusion of operations to bare minimum. In order to keep the intrusion time minimum, we collect the causal-interrelationships vectors and compute the exact minimum set in the beginning of the algorithm. In coordinated DRLaccumulation, if a single operation flops to save its reclamation-dot; all the DRLaccumulation effort goes waste, because, each operation has to abort its partiallycommitted reclamation-dot. In order to save its partially-committed reclamation-dot, a Mob_Nod (Mobile Node) needs to transfer large reclamation-dot data to its local MobSpt-Stn (Mobile Support Station) over wireless channels. The DRL-accumulation effort may be exceedingly high due to frequent abandons especially in mobile systems. We try to minimize the loss of DRL-accumulation effort when any operation flops to save its reclamation-dot in coordination with others. In the first phase, we save perishable reclamation-dots only. In this case, if any operation flops to save its reclamation-dot in the first phase, all concerned operations needs to abort their perishable reclamationdots only and not the partially-committed ones.