This Article 
 Bibliographic References 
 Add to: 
A Model for Mobile Code Using Interacting Automata
October-December 2002 (vol. 1 no. 4)
pp. 313-326

Abstract—The Internet supports migration of code from node to node. A number of paradigms exist for distributed computing and mobile code, including client/server, remote evaluation, code-on-demand, and mobile agents. We find them overly-restrictive views of reality. We propose a model that can express previous paradigms as special cases. We derive a model using Cellular Automata (CA) abstractions to study relations between local node behavior and global system behavior. Example mobile code systems are provided and existing paradigms are expressed in terms of the model. These examples include network attacks such as viruses, worms, and Distributed Denial of Service (DDoS). A distributed system simulation tool based on the model is described. Simulation results provide insights gained from this work.

[1] J. von Neumann, Theory of Self-Reproducing Automata, A.W. Burks, ed., Urbana, Ill.: Univ. of Illinois Press, 1966.
[2] S. Wolfram, Cellular Automata and Complexity. Reading, Mass: Addison-Wesley, 1994.
[3] J. Portugali, Self-Organization and the City, Springer Series in Synergetics, Berlin: Springer Verlag, 2000.
[4] H. Haken, Erfolgsgehimnisse der Natur, Synergetik: Die Lehre vom Zusammenwirken. Hamburg: Rowohlt, 1981.
[5] S.A. Kauffman, The Origins of Order: Self-Organization and Selection in Evolution. New York: Oxford Univ. Press, 1993.
[6] S. Camazine et al., Self-Organization in Biological Systems. Princeton, N.J.: Princeton Univ. Press, 2001.
[7] W. Leland et al., "On the Self-Similar Nature of Ethernet Traffic (Extended Version)," IEEE/ACM Trans. Networking, Vol. 2, No. 1, Feb. 1994, pp. 1-15.
[8] M. Grossglauser and J.-C. Bolot, "On the Relevance of Long-Range Dependence in Network Traffic," IEEE/ACM Trans. Networking, vol. 7, no. 5, Oct. 1999, pp. 629-640.
[9] W. Willinger and V. Paxson, “Where Mathematics Meets the Internet,” Notices of the AMS, pp. 961-971, Sept. 1998.
[10] R. Brooks and C. Griffin, “Traffic Model Evaluation of Ad Hoc Target Tracking Algorithms,” J. High Performance Computer Applications, Jan. 2002.
[11] K. Nagel, “From Particle Hopping Models to Traffic Flow Theory,” Traffic Flow Theory Simulation Models, Macroscopic Flow Relationships, and Flow Estimation and Prediction: Transportation Research Record No. 1644, pp. 1-9, Transportation Research Board Nat'l Research Council, Washington: Nat'l Academy Press, 1998.
[12] D. Wu, D. Agrawal, and A. Abbadi, "StratOSphere: Unification of Code, Data, Location, Scope, and Mobility," Proc. Int'l Symp. Distributed Objects and Applications, ACM Press, 1999, pp. 12-23.
[13] A. Fuggetta, G. Picco, and G. Vigna, "Understanding Code Mobility," IEEE Trans. Software Eng., May 1998, pp. 352-361.
[14] Mobility: Processes Computers, and Agents, D. Milojicic, F. Douglis, and R. Wheeler, eds., Reading, Mass.: Addison-Wesley, 1999.
[15] D.L. Tennenhouse, J.M. Smith, W.D. Sincoskie, D.J. Wetherall, and G.J. Minden, “A Survey of Active Network Research,” IEEE Comm. Magazine, vol. 35, no. 1, pp. 80-86, Jan. 1997.
[16] W. Jansen and T. Karygiannis, “Mobile Agent Security,” NIST Special Publication 800-19, sp800-19.pdf Aug. 1999.
[17] R.R. Brooks and S.S. Iyengar, Multi-Sensor Fusion: Fundamentals and Applications with Software. Upper Saddle River, N.J.: Prentice Hall, 1998.
[18] N. Lynch, Distributed Algorithms. New Jersey, Morgan Kaufman, 1996.
[19] R. Brooks and S. Iyengar, Robust Distributed Computing and Sensing Algorithms Computer, vol. 29, no. 6, pp. 53-60, June 1996.
[20] S. Loureiro and R. Molva, “Mobile Code Protection with Smartcards,” Proc. Sixth ECOOP Workshop Mobile Object Systems, June 2000,
[21] L. Garber, Denial-of-Service Attacks Rip the Internet Computer, vol. 33, no. 4, pp. 12-17, Apr. 2000.
[22] A. Kott and B. Krogh, “Toward a Catalog of Pathological Behaviors in Complex Enterprize Control Systems,” Proc. DARPA-JFACC Symp. Advances in Enterprize Control, pp. 1-6, Nov. 1999, ( sess2-1.doc).
[23] F.C. Gartner, “Fundamentals of Fault-Tolerant Distributed Computing in Asynchronous Environment,” ACM Computing Surveys, vol. 31, no. 1, pp. 1–26, Mar. 1999.
[24] M. Schneider, “Self-Stabilization,” ACM Computing Surveys, vol. 25, no. 1, pp. 45-67, Mar. 1993.
[25] D.A. Fisher and H.F. Lipson, “Emergent Algorithms: A New Method for Enhancing Survivability in Unbounded Systems,” Proc. Hawaii Int'l Conf. System Sciences, Jan. 1999, .
[26] R. Sole and B. Goodwin, Signs of Life. New York: Basic Books, 2000.
[27] W. Hordijk, “Dynamics, Emergent Computation, and Evolution in Cellular Automata,” PhD dissertation, Computer Science, Univ. of New Mexico, Dec. 1999.
[28] H. Gutowitz, “Introduction,” Cellular Automata: Theory and Experiment, pp. vii-xiv, Cambridge, Mass.: MIT Press, 1991.
[29] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[30] H. Qi, X. Wang, S.S. Iyengar, and K. Chakrabarty, “High Performance Sensor Integration in Distributed Senor Network Using Mobile Agents,” The Int'l J. of High Performance Computer Application, vol. 16, no. 3, pp. 325-336, Fall 2002.
[31] A.V. Aho, R. Sethi, and J.D. Ullman, Compilers, Principles, Techniques and Tools.New York: Addison-Wesley, 1985.
[32] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Apr. 1979.
[33] W. Stallings, Network and Inter-Network Security Principles and Practice. Englewood Cliffs, NJ: Prentice Hall, 1995.
[34] R.R. Brooks, “Communicating Automata Model of Mobile Code and Network Pathology,” technical report, Applied Research Laboratory, The Pennsylvania State Univ., Aug. 2002.

Index Terms:
Cellular automata, process migration, mobile agents, mobile code, network security.
Richard R. Brooks, Nathan Orr, "A Model for Mobile Code Using Interacting Automata," IEEE Transactions on Mobile Computing, vol. 1, no. 4, pp. 313-326, Oct.-Dec. 2002, doi:10.1109/TMC.2002.1175545
Usage of this product signifies your acceptance of the Terms of Use.