Recent Trends on Consistent Global Snapshot Algorithms for Distributed Mobile Environments

Mobile computing allows omnipresent and incessant access to computing resources while the users is on the move In the recent years the mobility issues is one of the most significant development and effect the converging areas of computing and telecommunications The way to compute and communicate is changing rapidly. Failure that are rare with fixed hosts become common , host disconnection and mobility makes the fault detection & message coordination difficult. The various distributed applications of mobile / wireless environments are e-commerce , national defense , emergency & disaster management, telecommunications , the background studies report that snapshot is the technique used to tolerate failures in distributed system and thus well suited for mobile environments. There are different approaches for failure free executions of a nodes providing fault tolerance to the existing distributed system without fault tolerance, the application programs or software executing in a multiprocessor environment in a distributed system could fail entirely if even a single process executing part of it. An efficient recovery mechanism for distributed mobile environment is required to maintain the continuity of computation in the event of node failure. During the study it has been analyzed , to meet the requirement of mobile environment the recovery algorithm should meet the low energy consumption, reduced storage overhead having low communication & band width constraints.

[1]  Nuno Neves,et al.  Adaptive recovery for mobile environments , 1997, CACM.

[2]  Mukesh Singhal,et al.  Checkpointing with mutable checkpoints , 2003, Theor. Comput. Sci..

[3]  Ten-Hwang Lai,et al.  On Distributed Snapshots , 1987, Inf. Process. Lett..

[4]  Jai-Hoon Kim,et al.  Two-Tier Checkpointing Algorithm Using MSS in Wireless Networks , 2003 .

[5]  Achour Mostéfaoui,et al.  Communication-Induced Determination of Consistent Snapshots , 1999, IEEE Trans. Parallel Distributed Syst..

[6]  Arup Acharya,et al.  SERVICES FOR NETWORKS WITH MOBILE HOSTS , 1995 .

[7]  W. Kent Fuchs,et al.  Lazy checkpoint coordination for bounding rollback propagation , 1992, Proceedings of 1993 IEEE 12th Symposium on Reliable Distributed Systems.

[8]  Mukesh Singhal,et al.  Mutable checkpoints: a new checkpointing approach for mobile computing systems , 1999, PODC '99.

[9]  Achour Mostéfaoui,et al.  Communication-induced determination of consistent snapshots , 1998, Digest of Papers. Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing (Cat. No.98CB36224).

[10]  Ch. D. V. Subba Rao,et al.  A new, efficient coordinated checkpointing protocol combined with selective sender-based message logging , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.

[11]  WTMR--A New Fault Tolerance Technique for Wireless and Mobile Computing Systems , 2007, 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS'07).

[12]  William H. Sanders,et al.  Distributed snapshots for mobile computing systems , 2004, Second IEEE Annual Conference on Pervasive Computing and Communications, 2004. Proceedings of the.

[13]  P. L. Ramteke An Optimal Checkpoint Interval- a Novel Checkpointing Approach for mobile Consumer Devices , 2014 .

[14]  Prithwish Basu,et al.  A mobility based metric for clustering in mobile ad hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[15]  Anil Kumar Panghal,et al.  Minimum-Process Synchronous Checkpointing in Mobile Distributed Systems , 2011 .

[16]  B. R. Badrinath,et al.  Checkpointing distributed applications on mobile computers , 1994, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems.

[17]  Harinandan Tunga,et al.  A Fast and Efficient Non-Blocking Coordinated Movement-Based Check pointing Approach for Distributed Systems , 2012 .

[18]  Yoshifumi Manabe A distributed consistent global checkpoint algorithm with a minimum number of checkpoints , 1998, Proceedings Twelfth International Conference on Information Networking (ICOIN-12).

[19]  Tomasz Imielinski,et al.  Structuring distributed algorithms for mobile hosts , 1994, 14th International Conference on Distributed Computing Systems.

[20]  Se Won Lee,et al.  Power-aware optimal checkpoint intervals for mobile consumer devices , 2011, IEEE Transactions on Consumer Electronics.

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

[22]  P Kanmani Fault tolerance using token ring checkpointing in distributed mobile computing systems , 2013 .

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

[24]  V. Rajaraman,et al.  A survey of checkpointing algorithms for parallel and distributed computers , 2000 .