A Review of Fault Tolerant Checkpointing Protocols for Mobile Computing Systems

Abstract

A distributed system is a collection of independent entities that cooperate to solve a problem that cannot be individually solved. A mobile computing system is a distributed system where some of processes are running on mobile hosts (MHs), whose location in the network changes with time. Mobile distributed systems raise new issues such as mobility, low bandwidth of wireless channels, disconnections, limited battery power and lack of reliable stable storage on mobile nodes. This paper addresses the problem of fault tolerant computing in mobile distributed systems. The techniques described are based on checkpointing and roll back recovery.

A dependability evaluation for Internet of Things incorporating redundancy aspects

“…In this context, we can classify faults as either transient or permanent [7]. Transient faults usually affect communication links between devices for a short time (on the millisecond scale [8]) and are caused by noise or electromagnetic inter ference.…”

Soft-Checkpointing Based Hybrid Synchronous Checkpointing Protocol for Mobile Distributed Systems

“…They have captured the transitive dependencies during the normal execution by piggybacking checkpoint sequence numbers onto normal computation messages. Garg and Kumar (2010) proposed a nonblocking coordinated checkpointing protocol for mobile distributed systems, where only minimum numbers of processes are required to commit the checkpoints. They have reduced the message complexity as compared to the algorithm proposed by Cao and Singhal (2001) algorithm, while keeping the number of useless checkpoints unchanged.…”