This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management
March 2003 (vol. 14 no. 3)
pp. 193-202

Abstract—Ant routing is a method for network routing in the agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary analysis on an ant algorithm in regard to its population growing property and jumping behavior. For synchronous networks, three main results are shown. First, the expected number of agents in a node is shown to be no more than (1+\max_i\{|\Omega_i|\})km , where |\Omega_i| is the number of neighboring hosts of the i{\rm{th}} host, k is the number of agents generated per request, and m is the average number of requests. Second, the expected number of jumps of an agent is shown to be no larger than (1+\max_i\{|\Omega_i|\}) . Third, it is shown that for all p\geq (1+\max_i\{|\Omega_i|\})km , the probability of the number of agents in a node exceeding p is not greater than \int_p^\infty {\cal{P}}(x) dx , where {\cal{P}}(x) is a normal distribution function with mean and variance given by Mean = (1+\max_i\{|\Omega_i|\})km , Var. = 2km (1+\max_i \{|\Omega_i|\}) + {\frac{(km)^2(1+\max_i\{|\Omega_i|\})^2}{(1+2\max_i\{|\Omega_i|\})}} . The first two results are also valid for the case when the network is operated in asynchronous mode. All these results conclude that as long as the value \max_i\{|\Omega_i|\} is known, the practitioner is able to design the algorithm parameters, such as the number of agents being created for each request, k , and the maximum allowable number of jumps of an agent, in order to meet the network constraint.

[1] L. Cardelli, “A Language with Distributed Scope,” Proc. ACM Symp. Principles of Programming Languages, pp. 286-297, 1995.
[2] F. Douglis and J. Ousterhout, "Transparent Process Migration: Design Alternatives and the Sprite Implementation," Software Practice&Experience, Vol. 21, Aug. 1991, pp. 757-785.
[3] C.G. Harrison, D.M. Chess, and A. Kershenbaum, “Mobile Agents: Are They a Good Idea?,” technical report, IBM Research Division, T.J. Watson Research Center, (http://www.research.ibm.com/massdistmobag.ps ), Mar. 1995.
[4] E. Jul, H. Levy, N. Hutchinson, and A. Black, “Fine-Grained Mobility in the Emerald System,” ACM Trans. Computer Systems, vol. 6, no. 1, pp. 109–133, Feb. 1988.
[5] M. Ranganathan, A. Acharya, S. Sharma, and J. Saltz, “Network-aware Mobile Programs,” Proc. USENIX, Winter 1997.
[6] T. Thorn, “Programming Languages for Mobile Code,” ACM Computing Surveys, vol. 29, no. 3, pp. 213-239, Sept. 1997.
[7] A. Lingnau, O. Drobnik, and P. Domel, “An HTTP-Based Infrastructure for Mobile Agents,” Proc. Fall 1995 WWW Conf., Dec. 1995.
[8] C. Munday, J. Dangedej, T. Cross, and D. Lukose, “Motivation and Perception Mechanisms in Mobil Agent for Electronic Commerce,” Proc. First Australian Workshop Distributed Artificial Intelligence, vol. 1087, pp. 144-158, Nov. 1996.
[9] P. Wayner, “Agents Away,” Byte, May 1994.
[10] G. Karjoth, D.B. Lange, and M. Oshima, A Security Model for Aglets Internet Computing, vol. 1, no. 4, pp. 68-77, 1997.
[11] D. Lange and M. Oshima, Programming and Deploying Java Mobile Agents with Aglets. Addison Wesley, 1998.
[12] “ObjectSpace. ObjectSpace Voyager Core Package Technical Overview,” technical report, ObjectSpace, Inc., July 1997.
[13] R.S. Gray, “Agent TCL: A Flexible and Secure Mobile-Agent System,” Proc. Fourth Ann. TCL/TK Workshop, (TCL '96), July 1996.
[14] D. Johansen, R. van Renesse, and F.B. Schneider, “An Introduction to the TACOMA Distributed System,” Technical Report 95-23, Dept. of Computer Science, Univ. of Tromso, June 1995.
[15] J. Hylton, K. Manheimer, F.L. Drake Jr., B. Warsaw, R. Masse, and G. van Rossum, “Knowbot Programming: System Support for Mobile Agents,” Proc. Fifth Int'l Workshop Object Orientation in Operating Systems (IWOOOS '96), Oct. 1996.
[16] J.E. White, “Mobile Agents,” technical report, General Magic, available at URLhttp://www.genmagic.comTelescript/, Oct. 1995.
[17] B. Bakshi, P. Krishna, N. Vaidya, and D. Pradhan, “Improving Performance of TCP Over Wireless Networks, Dept. of Computer Science, Texas A&M Univ., Technical Report 96-014, May 1996.
[18] H. Balakrishnan et al., "Improving TCP/IP Performance over Wireless Networks," Proc. 1st ACM Int'l Conf. Mobile Computing and Networking, ACM Press, New York, Nov. 1995.
[19] C. Perkins, “Providing Continuous Network Access to Mobile Hosts Using TCP/IP,” Computer Networks and ISDN Systems, vol. 26, pp. 357-370, Nov. 1993.
[20] J. Solomon, Mobile IP: The Internet Unplugged, Prentice Hall, Englewood Cliffs, N.J., to be published in 1998.
[21] M. Taylor, M. Banan, and W. Waung, Internetwork Mobility: The CDPD Approach, Prentice Hall, 1997.
[22] A. Bieszczad, T. White, and B. Pagurek, “Mobile Agents for Network Management,” IEEE Comm. Surveys, Sept. 1998.
[23] M. El-Darieby and A. Bieszczad, “Intelligence Mobile Agents: Towards Network Fault Management Automation,” Proc. Sixth IFIP/IEEE Int'l Symp. Integrated Network Management, May 1999.
[24] J. Wolf, B. Iyer, K. Pattipati, and J. Turek,“Optimal buffer partitioning for the nested block join algorithm,”inProc. 7th Int. Conf. Data Eng., Kobe, Japan, Apr. 1991, pp. 510–519.
[25] T. White, “Routing with Swarm Intelligence,” Technical Report SCE-97-15, Systems and Computer Eng., Carleton Univ., Sept. 1997.
[26] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall, 1996.
[27] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[28] T. White, B. Pagurek, and F. Oppacher, “ASGA: Improving the Ant System by Integration with Genetic Algorithms,” Proc. Third Conf. Genetic Programming (GP/SGA '98), pp. 610-617, July 1998.
[29] T. White, B. Pagurek, and F. Oppacher, “Connection Management Using Adaptive Agents,” Proc. PDPTA '98, pp. 802-809, July 1998.
[30] T. White and B. Pagurek, “Towards Multi-Swarm Problem Solving in Networks,” Proc. Third Int'l Conf. Multi-Agent Systems (ICMAS '98), pp. 333-340, July 1998.
[31] B. Bullnheimer, R.F. Hartl, and C. Strauss, “Applying the Ant System to the Vehicle Routing Problem,” Proc. Second Metaheuristics Int'l Conf. (MIC-97), 1997.
[32] G. Di Caro and M. Dorigo, “AntNet: A Mobile Agents Approach to Adaptive Routing,” Technical Report IRIDIA/97-12, Univ. Libre de Bruxelles, Belgium, 1997.
[33] R. Bronson, Matrix Operation. Schaum's Outline Series, McGraw Hill, 1989.
[34] H. William, K. Cheung, C.H. Li, E.C.M. Lam, and J. Liu, “Customized Electronic Commerce with Intelligent Software Agents,” Internet Commerce and Software Agents, S.M. Rahman, ed., Idea Group Publishing, 2000.

Index Terms:
Mobile agents routing algorithms, networking routing, ant algorithm.
Citation:
John Sum, Hong Shen, Chi-sing Leung, G. Young, "Analysis on a Mobile Agent-Based Algorithm for Network Routing and Management," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 193-202, March 2003, doi:10.1109/TPDS.2003.1189578
Usage of this product signifies your acceptance of the Terms of Use.