A weighted checkpointing protocol for mobile distributed systems
by Lalit K. Awasthi, Manoj Misra, R.C. Joshi
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 5, No. 3, 2010

Abstract: Here, we propose a weighted checkpointing approach for Mobile Distributed Computing Systems (MDCSs) that significantly reduces checkpointing overheads on mobile nodes. Checkpointing protocols can be coordinated, log-based or quasi-synchronous. Coordinated checkpointing requires extra synchronisation messages and may block the underlying computation. In quasi-synchronous approach, processes have limited autonomy in checkpointing but all nodes need not checkpoint concurrently. Such protocols guarantee consistent global state but results in dynamic checkpointing overheads. To minimise these overheads, we propose a weighted checkpointing protocol that requires no synchronisation messages, reduces the checkpointing overheads at mobile nodes but requires logging for mobile nodes. Simulation results show that the new approach is better than quasi-synchronous approach.

Online publication date: Wed, 17-Mar-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com