This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Optimistic Message Logging Scheme for Recoverable Mobile Computing Systems
October-December 2002 (vol. 1 no. 4)
pp. 265-277
Taesoon Park, IEEE Computer Society
Namyoon Woo, IEEE Computer Society
Heon Y. Yeom, IEEE Computer Society

Abstract—A number of checkpointing and message logging algorithms have been proposed to support fault tolerance of mobile computing systems. However, little attention has been paid to the optimistic message logging scheme. Optimistic logging has a lower failure-free operation cost compared to other logging schemes. It also has a lower failure recovery cost compared to the checkpointing schemes. This paper presents an efficient scheme to implement optimistic logging for the mobile computing environment. In the proposed scheme, the task of logging is assigned to the mobile support station so that volatile logging can be utilized. In addition, to reduce the message overhead, the mobile support station takes care of dependency tracking and the potential dependency between mobile hosts is inferred from the dependency between mobile support stations. The performance of the proposed scheme is evaluated by an extensive simulation study. The results show that the proposed scheme requires a small failure-free overhead and the cost of unnecessary rollback caused by the imprecise dependency is adjustable by properly selecting the logging frequency.

[1] A. Acharya and B.R. Badrinath, "Checkpointing Distributed Applications on Mobil Computers," Proc. Third Int'l Conf. Parallel and Distributed Information Systems, Sept. 1994.
[2] J.S.M. Ho and I. F. Akyildiz, “On Location Management for Personal Communications Networks,” IEEE Comm. Magazine, pp. 138-145, Sept. 1996.
[3] L. Alvisi and K. Marzullo, “Message Logging: Pessimistic, Optimistic and Causal,” Proc. 15th Int'l Conf. Distributed Computing Systems, pp. 229-236, 1995.
[4] G. Cao and M. Singhal, “Low-Cost Checkpointing with Mutable Checkpoints in Mobile Computing Systems,” Proc. 18th Int'l Conf. Distributed Computing Systems, pp. 464-471, May 1998.
[5] K.M. Chandy and L. Lamport, "Distributed Snapshots: Determining Global States of Distributed Systems," ACM Trans. Computer Systems, Feb. 1985.
[6] F. Cristian and F. Jahanian, "A Timestamp-Based Checkpointing Protocol for Long-Lived Distributed Computations," Proc. IEEE Symp. Reliable Distributed Systems, pp. 12-20, 1991.
[7] O.P. Damani and V.K. Garg, “How to Recover Efficiently and Asynchronously when Optimism Fails,” Proc. 16th Int'l Conf. Distributed Computing Systems, pp. 108-115, 1996.
[8] E.N. Elnozahy and W. Zwaenepoel, “Manetho—Transparent Rollback-Recovery with Low Overhead, Limited Rollback, and Fast Output Commit,” IEEE Trans. Computers, vol. 41, no. 5, pp. 526–531, May 1992.
[9] J.L. Kim and T. Park, "An Efficient Protocol For Checkpointing Recovery in Distributed Systems," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 955-960, Aug. 1993.
[10] R. Koo and S. Toueg, "Checkpointing and Rollback-Recovery for Distributed Systems," IEEE Trans. Software Eng., vol. 13, no. 1, pp. 23-31, Jan. 1987.
[11] J. Li, H. Kameda, and K. Li, “Optimal Dynamic Location Update for PCS Networks,” Proc. 19th Int'l Conf. Distributed Computing Systems, 1999.
[12] D. Manivannan and M. Singhal, “Failure Recovery Based on Quasi-Synchronous Checkpointing in Mobile Computing Systems,” OSU-CISRC-7/96-TR36, Dept. of Computer and Information Science, The Ohio State Univ., 1996.
[13] N. Neves and W.K. Fuchs, “Adaptive Recovery for Mobile Environments,” Comm. ACM, vol. 40, no. 1, pp. 68-74, Jan. 1997.
[14] T. Park and H.Y. Yeom, “Application Controlled Checkpointing Coordination for Fault-Tolerant Distributed Computing Systems,” Parallel Computing, vol. 26, no. 4, pp. 467-482, Mar. 2000.
[15] T. Park, N. Woo, and H.Y. Yeom, “Efficient Recovery Information Management Schemes for the Fault Tolerant Mobile Computing Systems,” Proc. 20th Symp. Reliable Distributed Systems, pp. 202-205, 2001.
[16] T. Park, N. Woo, and H.Y. Yeom, “An Efficient Recovery Scheme for Fault-Tolerant Mobile Computing Systems,” Future Generation Computer Systems, vol. 19, no. 1, pp. 37-53, Dec. 2002.
[17] D.K. Pradhan, P. Krishna, and N.H. Vaiday, “Recoverable Mobile Environment: Design and Trade-Off Analysis,” Proc. 26th Int'l Symp. Fault-Tolerant Computing Systems, pp. 16-25, 1996.
[18] R. Prakash and M. Singhal, "Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems," IEEE Trans. Parallel and Distributed System, vol. 7, no. 10, pp. 1,035-1,048, Oct. 1996.
[19] B.L. Randell, P.A. Lee, and P.C. Treleaven, “Reliability Issue in Computing System Design,” ACM Computing Surveys, vol. 2, pp. 123-166, 1978.
[20] R. D. Schlichting and F. B. Schneider,“Fail-stop processors: An approach to designing fault-tolerant computing systems,”ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 222–238, Aug. 1983.
[21] D.B. Johnson, S.W. Smith, and J.D. Tygar, “Completely Asynchronous Optimistic Recovery with Minimal Rollbacks,” Proc. 25th Symp. Fault-Tolerant Computing Systems, pp. 361-370, 1995.
[22] K. Venkatesh, T. Radhakrishan, and H.F. Li, “Optimal Checkpointing and Local Recording for Domino-Free Rollback Recovery,” Information Processing Letters, vol. 25, pp. 295-303, 1987.
[23] Y.M. Wang, O.P. Damani, and V.K. Garg, “Distributed Recovery with k-Optimistic Logging,” Proc. 17th Int'l Conf. Distributed Computing Systems, pp. 60-69, 1997.
[24] Y.M. Wang and W.K. Fuchs, “Lazy Checkpoint Coordination for Bounding Rollback Propagation,” Proc. 12th Symp. Reliable Distributed Systems, pp. 78-85, 1993.
[25] B. Yao, K.F. Ssu, and W.K. Fuchs, “Message Logging in Mobile Computing,” Proc. IEEE Fault-Tolerant Computing Symp., pp. 294-301, June 1999.

Index Terms:
Distributed systems, fault tolerance, mobile computing, message logging, asynchronous recovery.
Citation:
Taesoon Park, Namyoon Woo, Heon Y. Yeom, "An Efficient Optimistic Message Logging Scheme for Recoverable Mobile Computing Systems," IEEE Transactions on Mobile Computing, vol. 1, no. 4, pp. 265-277, Oct.-Dec. 2002, doi:10.1109/TMC.2002.1175540
Usage of this product signifies your acceptance of the Terms of Use.