A Failure Recovery Scheme in Mobile Computing System Based on Checkpointing and Handoff Count

In Mobile hosts failure probability is high. An efficient checkpointing technique and a failure recovery scheme together can make a mobile computing system fault-tolerant. For efficient recovery, information of a mobile host should be kept in an organized manner. Efficiency of a recovery scheme can be measured in terms of time and cost. Mobile hosts move randomly and handoff occurs. Information of a single mobile host gets scattered over a number of mobile support stations that can be at closer or further distance. Recovery time and cost primarily depend on number of mobile support stations from which information to be collected as well as distance among them. Larger the distance, longer the time for communication through message passing. Number of mobile support stations from which information to be recovered and distance among them can be delimited by keeping a handoff threshold value in each mobile host. Recovery scheme proposed here applies both the measures. Our work optimizes both failure-free and failurerecovery operation costs. Index Terms— coordinated checkpointing, communication induced checkpointing, domino effect, minimal checkpoint, non-blocking checkponting, optimistic logging, message passing systems ——————————  ——————————

[1]  Mukesh Singhal,et al.  On Coordinated Checkpointing in Distributed Systems , 1998, IEEE Trans. Parallel Distributed Syst..

[2]  S. Neogy,et al.  A Low Overhead Checkpointing Scheme for Mobile Computing Systems , 2007, 15th International Conference on Advanced Computing and Communications (ADCOM 2007).

[3]  L. Alvisi,et al.  A Survey of Rollback-Recovery Protocols , 2002 .

[4]  Mukesh Singhal,et al.  Low-cost checkpointing with mutable checkpoints in mobile computing systems , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[5]  Mukesh Singhal,et al.  Maximal global snapshot with concurrent initiators , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[6]  Mukesh Singhal,et al.  Efficient distributed channel allocation for mobile cellular networks , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[7]  Mukesh Singhal,et al.  An efficient causal ordering algorithm for mobile computing environments , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[8]  RICHARD KOO,et al.  Checkpointing and Rollback-Recovery for Distributed Systems , 1986, IEEE Transactions on Software Engineering.

[9]  Ing-Ray Chen,et al.  Movement-based checkpointing and logging for recovery in mobile computing systems , 2006, MobiDE '06.

[10]  Praveen Kumar,et al.  A Review of Fault Tolerant Checkpointing Protocols for Mobile Computing Systems , 2010 .

[11]  Shahram Rahimi,et al.  A New High Performance Checkpointing Approach for Mobile Computing Systems , 2006 .

[12]  Mukesh Singhal,et al.  Modeling and analysis of channel transferability in mobile computing environments , 1996, Proceedings of 1996 International Conference on Parallel and Distributed Systems.

[13]  Mukesh Singhal,et al.  Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems , 1996, IEEE Trans. Parallel Distributed Syst..