The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - Feb. (2013 vol.62)
pp: 247-258
Rajwinder Singh , National Institute of Technology, Kurukshetra
Mayank Dave , National Institute of Technology, Kurukshetra
ABSTRACT
The flexibility offered by mobile agents is quite noticeable in distributed computing environments. However, the greater flexibility of the mobile agent paradigm compared to the client/server computing paradigm comes at an additional threats since agent systems are prone to failures originating from bad communication, security attacks, agent server crashes, system resources unavailability, network congestion, or even deadlock situations. In such events, mobile agents either get lost or damaged (partially or totally) during execution. In this paper, we propose parallel checkpointing approach based on the use of antecedence graphs for providing fault tolerance in mobile agent systems. During normal computation message transmission, the dependency information among mobile agents is recorded in the form of antecedence graphs by participating mobile agents of mobile agent group. When a checkpointing procedure begins, the initiator concurrently informs relevant mobile agents, which minimizes the identifying time. The proposed scheme utilizes the checkpointed information for fault tolerance which is stored in form of antecedence graphs. In case of failures, using checkpointed information, the antecedence graphs and message logs are regenerated for recovery and then normal operation continued. Moreover, compared with the existing schemes, our algorithm involves the minimum number of mobile agents during the identifying and checkpoiting procedure, which leads to the improvement of the system performance. In addition, the proposed algorithm is a domino-free checkpointing algorithm, which is especially desirable for mobile agent systems. Quantitative analysis and experimental simulation show that our algorithm outperforms other coordinated checkpointing schemes in terms of the identifying time and the number of blocked mobile agents and then can provide a better system performance. The main contribution of the proposed checkpointing scheme is the enhancement of graph-based approach in terms of considerable improvement by reducing message overhead, execution, and recovery times.
INDEX TERMS
Mobile agents, Checkpointing, Fault tolerance, Fault tolerant systems, Servers, Protocols, message logs, Mobile agents, fault tolerance, reliability, failure, antecedence graphs, checkpointing
CITATION
Rajwinder Singh, Mayank Dave, "Antecedence Graph Approach to Checkpointing for Fault Tolerance in Mobile Agent Systems", IEEE Transactions on Computers, vol.62, no. 2, pp. 247-258, Feb. 2013, doi:10.1109/TC.2011.235
REFERENCES
[1] D.B. Lange and M. Oshima, Programming and Deploying Java Mobile Agents Aglets. Addison-Wesley Longman Publishing Co., 1998.
[2] D.B. Lange and M. Oshima, “Seven Good Reasons for Mobile Agents,” ACM Comm., vol. 42, no. 3, pp. 88-89, 1999.
[3] W. Qu and H. Shen, “Analysis of Mobile Agents' Fault-Tolerant Behaviour,” Proc. IEEE/WIC/ACM Int'l Conf. Intelligent Agent Technology, pp. 377-380, 2004.
[4] S.S. Manvi and P. Venkataram, “Applications of Agent Technology in Communications: A Review,” Springer Computer Comm., vol. 27, pp. 1493-1508, 2004.
[5] L.L. Pullum, Software Fault Tolerance Techniques and Implementation. Artech House, 2001.
[6] S. Pleisch and A. Schiper, “Non-Blocking Mobile Agent Execution,” Proc. IEEE 22nd Int'l Conf. Distributed Computing Systems, 2002.
[7] W. Qu, H. Shen, and X. Defago, “A Survey of Mobile Agent-Based Fault-Tolerant Technology,” Proc. IEEE Sixth Int'l Conf. Parallel and Distributed Computing Applications and Technologies, pp. 446-450, 2005.
[8] W. Qu and H. Shen, “Analysis of Mobile Agents' Fault-Tolerant Behaviour,” Proc. IEEE/WIC/ACM Int'L Conf. Intelligent Agent Technology, 2004.
[9] K.T. Vogler and M.L. Moschgath, “An Approach for Mobile Agent Security and Fault Tolerance Using Distributed Transaction,” Proc. Int'l Conf. Parallel and Distributed Systems, pp. 268-274, 1997.
[10] D. Johansen, K. Marzullo, F.B. Schneider, K. Jacobsen, and D. Zagorodnov, “NAP: Practical Fault-Tolerance for Itinerant Computations,” Proc. IEEE 19th Int'l Conf. Distributed Computing Systems, pp. 180-189, 1999.
[11] K. Rothermel and M. Strasser, “A Fault-Tolerant Protocol for Providing the Exactly-Once Property of Mobile Agents,” Proc. IEEE 17th Symp. Reliable Distributed Systems, pp. 100-108, 1998.
[12] F.M.A. Silva and R. Popescu-Zeletin, “An Approach for Providing Mobile Agent Fault Tolerance,” Proc. Second Int'l Workshop Mobile Agents, vol. 1477, pp. 14-25, 1998.
[13] S. Pleisch and A. Schiper, “FATOMAS-A Fault-Tolerant Mobile Agent System Based on the Agent-Dependent Approach,” Proc. IEEE Int'l Conf. Dependable Systems and Networks, pp. 215-224, 2001.
[14] S. Pleisch and A. Schiper, “Non-Blocking Mobile Agent Execution,” Proc. IEEE 22nd Int'l Conf. Distributed Computing Systems, 2002.
[15] M.M. Khokhar, A. Nadeem, and O.M. Paracha, “An Antecedence Graph Approach for Fault Tolerance in a Multi-Agent System,” Proc. IEEE Seventh Int'l Conf. Mobile Data Management, 2006.
[16] D. Manivannan and M. Singhal, “Failure Recovery Based on Quasi-Synchronous Checkpointing in Mobile Computing Systems,” Technical Report OSU-CISRC-796-TR36, Dept. of Computer and Information Science, The Ohio State Univ., 1996.
[17] A. Acharya and B.R. Barinath, “Checkpointing Distributed Applications on Mobile Computing,” Proc. Third Int'l Conf. Parallel and Distributed Information System, pp. 73-80, 1994.
[18] A. Agbaria and W.H. Sanders, “Distributed Snapshots for Mobile Computing Systems,” Proc. IEEE Second Int'l Conf. Pervasive Computing and Comm., pp. 177-188, 2004.
[19] E.N. (Mootaz)Elnozahy, L. Alvisi, Y. Wang, and D.B. Johnson, “A Survey of Rollback-Recovery Protocols in Message-Passing Systems,” ACM Computing Surveys, vol. 34, no. 3, pp. 375-408, 2002.
[20] H.K. Yeom, H.Y.T. Park, and H. Park, “The Cost of Checkpointing, Logging and Recovery for the Mobile Agent Systems,” Proc. Pacific Rim Int'l Symp. Dependable Computing, pp. 45-48, 2002.
[21] T. Osman, W. Wagealla, and A. Bargiela, “An Approach to Rollback Recovery of Collaborating Mobile Agents,” IEEE Trans. Systems, Man, and Cybernetics, Part C: Applications and Rev., vol. 34, no. 1, pp. 48-57, Feb. 2004.
[22] H. Hamidi and K. Mohammadi, “Modeling Fault Tolerant and Secure Mobile Agent Execution in Distributed Systems,” Int'l J. Intelligent Information Technologies, vol. 2, no. 1, pp. 176-181, 2006.
[23] J. Yang, J. Cao, and W. Wu, “CIC: An Integrated Approach to Checkpointing in Mobile Agent Systems,” Proc. IEEE Second Int'l Conf. Semantics, Knowledge and Grid, 2006.
[24] V F. Nicola, “Checkpointing and the Modelling of Program Execution Time,” Software Fault Tolerance, pp. 167-88, John Wiley,, 1995.
[25] T. Walsh, N. Paciorek, and D. Wong, “Security and Reliability in Concordia,” Proc. Int'l Conf. System Sciences, June 1998.
[26] S. Pears, J. Xu, and C. Boldyreff, “Mobile Agent Fault Tolerance for Information Retrieval Applications: An Exception Handling Approach,” Proc. Sixth Int'l Symp. Autonomous Decentralized Systems, pp. 115-22, Apr. 2003.
[27] S.J. Xu and C. Boldyreff, “A Dynamic Shadow Approach for Mobile Agents to Survive Crash Failures,” Proc. IEEE Sixth Int'l Symp. Object-Oriented Real-Time Distributed Computing, pp. 113-20, May 2003.
[28] P.S. Mandal and K. Mukhopadhayaya, “Checkpointing Using Mobile Agents in Distributed Systems,” Proc. IEEE Int'l Conf. Computing, Theory and Applications, 2007.
[29] E.N. Elnozahy, “Manetho: Fault Tolerance in Distributed Systems Using Rollback-Recovery and Process Replication,” PhD thesis Rice Univ., Houston, Texas, 1993.
[30] M. Tosic and A. Zaslavsky, “Reliable Multi-Agent Systems with Persistent Publish/Subscribe Messaging,” Proc. 18th Industrial and Eng. Applications of Artificial Intelligence and Expert Systems (IEA/AIE '05), vol. 3533, pp. 165-74, 2005.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool