Distance Based Asynchronous Recovery Approach in Mobile Computing Environment
Yogita Khatri

TL;DR
This paper proposes a distance-based recovery scheme for mobile computing systems that reduces transfer and recovery costs by limiting recovery information movement based on the mobile host's location.
Contribution
It introduces a novel distance-based checkpointing and message logging scheme tailored for mobile environments to improve fault tolerance efficiency.
Findings
Reduces recovery and transfer costs in mobile systems.
Allows localized recovery without moving all recovery information.
Enhances fault tolerance with minimal resource usage.
Abstract
A mobile computing system is a distributed system in which at least one of the processes is mobile. They are constrained by lack of stable storage, low network bandwidth, mobility, frequent disconnection and limited battery life. Checkpointing is one of the commonly used techniques to provide fault tolerance in mobile computing environment. In order to suit the mobile environment a distance based recovery scheme is proposed which is based on checkpointing and message logging. After the system recovers from failures, only the failed processes rollback and restart from their respective recent checkpoints, independent of the others. The salient feature of this scheme is to reduce the transfer and recovery cost. While the mobile host moves with in a specific range, recovery information is not moved and thus only be transferred nearby if the mobile host moves out of certain range.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Age of Information Optimization · Optimization and Search Problems
