The Eager, Lazy and Movement-based strategies are used in mobile computing system when handoff. They result in performance loss while moving the whole checkpoint on fault-free or slow recovery while not moving any checkpoint until recovery. In the paper, a compromise strategy is proposed. The whole recovery information are broken into two parts, which one little part with high-priority should be transferred to the new cell during handoff and another large part with low-priority should be transferred only when the mobile host recovers from a fault. From the view of mobile host, it seems that all recovery information reside on the local mobile support station. The strategy guarantees little performance losing when fault-free and quick recovery when fault occurs. Experiments and analysis show the handoff strategy performance overcomes others. © IFIP International Federation for Information Processing 2007.
CITATION STYLE
Men, C., Xu, Z., & Wang, D. (2007). An efficient Handoff strategy for mobile computing checkpoint system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4808 LNCS, pp. 410–421). Springer Verlag. https://doi.org/10.1007/978-3-540-77092-3_36
Mendeley helps you to discover research relevant for your work.