Analysis of Some Checkpointing Schemes for Distributed Mobile Computing Systems

Abstract

There exist mobile nodes in a distributed system, which arises some new issues like mobility, disconnections, low bandwidth of wireless channels, limited battery power capacity and lack of reliable stable storage on mobile nodes, that need proper handling when we design a checkpointing algorithm for distributed systems. It is not easy to predict whether the system will prolong to perform throughout or till approved time. Checkpoint is defined as a specify state in a program at which normal process is disrupted typically to maintain the information of status mandatory to allow renewal of processing at a later time in issue of a failure. This paper gives a summary of checkpointing strategies for mobile networks which are categories on the basis of quality of service of wireless networks, based on mobile agents, considering the mobility of MHs and transmission of checkpoints. We also represent a survey of some checkpointing algorithms for distributed systems

Similar works

Full text

thumbnail-image

International Journal of Research and Engineering

redirect
Last time updated on 09/04/2018

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.