A New Efficient Checkpointing Algorithm for Distributed Mobile Computing

• Houssem Mansouri

  Department of Computer Science, Faculty of Exact Sciences, University of Bejaia, 06000, Bejaia.

• Nadjib Badache

  Research Center on Scientific and Technical Information CERIST, Ben-Aknoun, Algiers, 16000.

• Makhlouf Aliouat

  Laboratory of Networks and Distributed Systems, Computer Science Department, University of Ferhat Abbas Sétif1, Sétif, 19000.

• Al-Sakib Khan Pathan

  Department of Computer Science, International Islamic University Malaysia, Kuala Lumpur, 53100.

Mobile networks have been quickly adopted by many companies and individuals due to their flexibility of use. However, multiple factors such as mobility and limited resources often put constraints on availability and thus cause instability of the wireless environment which poses serious challenge for fault tolerant distributed mobile applications. Therefore, the classical checkpointing techniques that enable the applications with capabilities to resist to failures are not always convenient in the mobile context. In fact, it is necessary now to think about other techniques or at least adapt those to devise effective and well suited techniques for the mobile environment. Considering this issue, our contribution in this paper is a proposal of a new checkpointing algorithm suitable for mobile computing systems. This algorithm is characterized by its efficiency and optimization in terms of incurred time-space overhead during checkpointing process and normal application running.

• PDF