A Model for Mobile Code Computing Paradigms in Computer Networks
محورهای موضوعی : Network ManagementHojatallah Hamidi 1 , Maryam Parvini 2
1 - K. N. Toosi University of Technology
2 - K. N. Toosi University of Technology
کلید واژه: Mobile Computing , Mobile Code , Computer Network , Computing Paradigms,
چکیده مقاله :
This paper presents a reliable model for mobile codes in distributed networks, which represents reliable mobile agent execution. The model ensures non-blocking mobile agent execution and forces the once property without relying on correct fault detection. A mobile agent execution is blocking if a fault of agent prevents the agent from continuing in its execution. The once problem is related to non-blocking in the sense that solutions to the latter may lead to multiple executions of the mobile agent. A solution to reliable mobile agent execution needs to ensure both the non-blocking and once properties. The analytical results show new theoretical perceptions into the statistical behaviors of mobile agents and provide useful tools for executing mobile agents in networks. The results show that agents' behavior is influenced by places' characteristics and the agents' behavior can be managed to network. In this paper, we analyzed the average time consuming of mobile agents between two places. The approach, Fault-Tolerant approach for mobile codes offers a user-transparent fault tolerance which can be selected by the user for every single application given to the environment. Thereby, the user can decide for every application weather it has to be treated fault-tolerant or not. We proposed a reliable execution model of mobile codes and analyzed the life expectancy, including the average time consuming of mobile agents between two places, the average number of places agents will visit, and the agents' life expectancy.
This paper presents a reliable model for mobile codes in distributed networks, which represents reliable mobile agent execution. The model ensures non-blocking mobile agent execution and forces the once property without relying on correct fault detection. A mobile agent execution is blocking if a fault of agent prevents the agent from continuing in its execution. The once problem is related to non-blocking in the sense that solutions to the latter may lead to multiple executions of the mobile agent. A solution to reliable mobile agent execution needs to ensure both the non-blocking and once properties. The analytical results show new theoretical perceptions into the statistical behaviors of mobile agents and provide useful tools for executing mobile agents in networks. The results show that agents' behavior is influenced by places' characteristics and the agents' behavior can be managed to network. In this paper, we analyzed the average time consuming of mobile agents between two places. The approach, Fault-Tolerant approach for mobile codes offers a user-transparent fault tolerance which can be selected by the user for every single application given to the environment. Thereby, the user can decide for every application weather it has to be treated fault-tolerant or not. We proposed a reliable execution model of mobile codes and analyzed the life expectancy, including the average time consuming of mobile agents between two places, the average number of places agents will visit, and the agents' life expectancy.
[1] H.Hamidi and K.Mohammadi, “Evaluation of Fault Tolerant Mobile Agents in Distributed Systems, “International Journal of Intelligent Information Technologies (IJIIT 5(1)), pp.43-60, Janauary-March 2009.#
[2] H.Hamidi and A.Vafaei, "Evaluation of Security and Fault-Tolerance in Mobile Agents," Proc.Of the 5th IEEE Conf. on Wireless & Optical Communications Networks (WOCN2008), May 5, 6 and 7, 2008.#
[3] H.Hamidi and K.Mohammadi, "Modeling and Evaluation of Fault Tolerant Mobile Agents in Distributed Systems," Proc.Of the 2th IEEE Conf . on Wireless & Optical Communications Networks (WOCN2005),pp.91-95, March 2005.#
[4] S. Pleisch and A. Schiper, "Modeling Fault-Tolerant Mobile Agent Execution as a Sequence of Agree Problems," Proc. of the 19th IEEE Symp. on Reliable Distributed Systems, pp. 11-20,2000.#
[5] S. Pleisch and A. Schiper, "FATOMAS - A Fault-Tolerant Mobile Agent System Based on the Agent-Dependent Ap¬proach," Proc. 2001 Int'l Conf on Dependable Systems and networks,pp.215-224,luI.2001.#
[6] M. Strasser and K. Rothermel, "System Mechanism for Par¬tial Rollback of Mobile Agent Execution," Proc. 20th In!'l Conf on Distributed Computing Systems, 2000.#
[7] T. Park, I. Byun, H. Kim and H.Y. Yeom, "The Performance of Checkpointing and Replication Schemes for Fault Tol¬erant Mobile Agent Systemss ," Proc. 21th IEEE Symp. On Reliable Distributed Systems, 2002.#
[8] M. Izatt, P. Chan, and T. Brecht. Ajents: Towards an Environment for Parallel, Distributed and Mobile Java Applications. In Proc. ACM 1999 Conference on Java Grande, pages 15-¬24, June 1999.#
[9] A. S. Tanenbaum, "Distributed Operating Systems",prentice Hall, Inc . , 1995#
[10] H.W.Chan,K.M.Wong , R.Lyu “ Design ,Implementation ,and Experimentation on Mobile Agent Security for Electronic Commerce Application,” Distributed systems, s. Mullender,ed., second ed., pp. 199-216, Reading, Mass.: Addison-wesley , 1993.#
[11] X.Defago,A. schiper,and N. sergent, “semi-passive Replication,”proc. 17th IEEE symp. Reliable Distributed system (SRDS ‘98), pp. 43-50, oct. 1998.#
[12] MJ. Fischer,N.A. Lynch and M.S. paterson, “Impossibility of Distributed consensus with one Faulty process,”Proc.second ACM SIGACT-SIGMOD symp. Principles of Database system,pp. 17, Mar.1983.#
[13] Michael S. Greenberg, Jennifer C. Byington, and David G. Harper. “Mobile Agents and Security”. In Volume 367, IEEE Communications Magazine. IEEE Press, July 1998.#
[14] Christian F. Tschudin. “Mobile Agent Security”. In M. Klusch, Intelligent Information Agents. Forthcoming LNCS. http://www.docs.uu.se/~tschudin/pub/cft-1999-iia.ps.gz, 1999.#
[15] C.Ghezzi, G, Vigna. “Mobile Code Paradigms and Technologies: A Case Study”. In Kurt Rothermet, Radu Popescu-Zeletin, editors, Mobile Agents, First International Workshop, MA’97, Berlin, Germany, April 1997, Proceedings, LNCS 1219, p. 39-49. Springer, 1997.#
[16] A.Fuggetta, , G. P.Picco, , & G.Vigna, Understanding code mobility. IEEE Transactions on Software Engineering, 24(5).(pp. 342–361,1998.#
[17] W.Stallings. Cryptography and Network Security, Principles and Practice. Prentice Hall, 2nd edition, 1999.#
[18] T.Sander and C. F. Tschudin. “Protecting Mobile Agents against Malicious Hosts”. In Giovanni Vigna, editor, Mobile Agents and Security, LNCS 1419, p. 44-60. Springer, 1998.#
[19] F. Hohl. “Time Limited Blackbox Security: Protecting Mobile Agents from Mali cious Hosts”. In Giovanni Vigna, editor, Mobile Agents and Security, LNCS 1419, p. 92-113. Springer, 1998.#
[20] M.K. Aguilera, w. chen, and s. Toueg, “Failure Detection and consensus in the crash-Recovery Model,” Distributed computing,vol. 13,no. 2,pp. 99-125,2000.#
[21] R. A. Sahner, K. S. Trivedi, and A. Puliafito. Performance and Reliablity Analysis of Computer Systems. Kluwer Academic Publishers, Boston, 1996.#
[22] S. Pleisch and A. Schiper, “Fault-Tolerant Mobile Agent Execution," IEEE TRANSACTIONS ON COMPUTERS, VOL. 52, NO .2, Feb 2003.#
[23] M. Strasser and K. Rothermel, "System Mechanism for Par¬tial Rollback of Mobile Agent Execution," Proc. 20th In!'l Conf on Distributed Computing Systems, 2000.#
[24] H. Hamidi, “Modeling Fault Tolerant and Secure Mobile Agent Execution in Distributed Systems, " International Journal of Intelligent Information Technologies (IJIIT 2(1)), pp.21-36, 2006.#
[25] H.Hamidi and A.Vafaei, July 2010 “Evaluation and Check pointing of Fault Tolerant Mobile Agents Execution in Distributed Systems,” Journal of Networks (Academy Publisher), VOL. 5, NO. 7. doi:10.4304/jnw.5.7.800-807.#
[26] A.Vafaei, H.Hamidi. , S.A. Monadjemi,. (2012). “A Framework for Fault Tolerance Techniques in the Analysis and Evaluation of Computing Systems” International Journal of Innovative Computing, Information and Control (IJICIC), Vol.8, No.7, July 2012.#
[27] Monadjemi, S. A., Hamidi, H., Vafaei, A. (2012). Analysis and Evaluation of a New Algorithm Based Fault Tolerance for Computing Systems. International Journal of Grid and High Performance Computing (IJGHPC), 4(1), 37-51. doi:10.4018/jghpc.2012010103 #
[28] Monadjemi, S. A., Hamidi, H., Vafaei, A. (2012). “ANALYSIS AND DESIGN OF AN ABFT AND PARITY-CHECKING TECHNIQUE IN HIGH PERFORMANCE COMPUTING SYSTEMS” Journal of Circuits, Systems, and Computers (JCSC), JCSC Volume 21 Number 3.#
