Statistical behaviors of mobile agents in network routing
Pages 360 - 388
Abstract
Mobile agent-based network routing is a new technique for routing in large-scale networks. An analysis of the searching activity and population growth of mobile agents is important for improving performance in agent-driven networks. In this paper, we describe a general execution model of mobile agents for network routing and classify it into two cases. For each case, we analyze the population distribution of mobile agents (the distribution of mobile agents running in the network) and the probability of success (the probability that an agent can find its destination). We also perform extensive experiments for various network topologies to validate our analytical results. Both theoretical and experimental results show that the population distribution and the probability of success of mobile agents can be controlled by locally adjusting relevant parameters, such as the number of agents generated per request, the number of jumps each mobile agent can move, etc. Our results reveal new theoretical insights into the statistical behaviors of mobile agents and provide useful tools for effectively managing mobile agents in large networks.
References
[1]
Baek JW, Yeo JH, Kim GT, Yeom HY (2001) Cost effective mobile agent planning for distributed information retrieval. In: Proc of the 21st int'l conf on distributed computing systems (ICDCS'01), pp 65-72, 2001.
[2]
Baek JW, Kim GT, Yeom HY (2002) Cost-effective planning of timed mobile agents, In: Proc of the int'l conf information technology: coding and computing (ITCC'02), pp 536-541, 2002.
[3]
Baek JW, Yeo JH, Yeom HY (2002) Agent chaining: an approach to dynamic mobile agent planning. In: Proc the 22nd int'l conf on distributed computing systems (ICDCS'02), pp 579-586, 2002.
[4]
Beckers R, Deneubourg JL, Goss S (1992) Trails and U-turns in the selection of the shortest path by the ant lasius niger. Theor Biol (159): 397-415.
[5]
Bergadano F, Puliafito A, Riccobene S, Ruffo G (1999) Java-based and secure learning agents for information retrieval in distributed systems. Inf Sci 113(1-2):55-84.
[6]
Bieszczad A, Pagurek B, White T (1998) Mobile agents for network management. IEEE Commun Surv 1(1):2-9.
[7]
Brewington B, Gray R, Moizumi K, Kotz D, Cybenko G, Rus D (1999) Mobile agents in distributed information retrieval. In: Klusch M (ed) Intelligent information agents: agents-based information discovery and management on the Internet. Springer, Berlin, pp 355-395, Chapter 15.
[8]
Calvert KL, Doar MB, Zegura EW (1997) Modelling Internet topology. IEEE Commun Mag 35(6):160-163.
[9]
Claessens J, Preneel B, Vandewalle J (2003) How can mobile agents do secure electronic transactions on untrusted hosts? A survey of the security issues and the current solutions. ACM Trans Internet Technol 3(1):28-48.
[10]
Caro GD, Dorigo M (1998) AntNet: distributed stigmergetic control for communications networks. J Artif Intell Res 9:317-365.
[11]
Caro GD, Dorigo M (1998) Mobile agents for adaptive routing. In: Proc of the 31st Hawaii int conf on system sciences, pp 74-83.
[12]
Curran K, Woods D, McDermot N, Bradley C (2003) The effects of badly behaved routers on Internet congestion. Int J Netw Manag 13(1):83-94.
[13]
Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1):29-41.
[14]
Du TC, Li EY, Chang AP (2003) Mobile agents in distributed network management. Commun ACM 46(7):127-132.
[15]
Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York.
[16]
Goss S, Aron S, Deneubourg JL, Pasteels JM (1989) Self-organized shortcuts in the Argentine ant. Naturwissenschaften 79:579-581.
[17]
He M, Jennings NR, Leung H (2003) On agent-mediated electronic commerce. IEEE Trans Know Data Eng 15(4):985-1003.
[18]
Heck PS, Ghosh S (2000) A study of synthetic creativity through behavior modeling and simulation of an ant colony. IEEE Intell Syst 15(6):58-66.
[19]
Hölldobler B, Wilson EO (1990) The Ants. Springer, Berlin.
[20]
Jayasimha DN, Schwiebert L, Manivannan D, May JA (2003) A foundation for designing deadlock-free routing algorithms in wormhole networks. J ACM 50(2):250-275.
[21]
Kim SH, Robertazzi TG (2000) Mobile agent modeling. SUNY at Stony Brook Technical Report 786.
[22]
Kotz D, Gray RW (1999) Mobile agents and the future of the Internet. ACM Oper Syst Rev 33(3):7-13.
[23]
Karjoth G, Lange D, Oshima M (1997) A security model for aglets. IEEE Internet Comput 1(4):68-77.
[24]
Lange D, Oshima M (1998) Programming and Developing Java Mobile Agents with Aglets. Addison-Wesley, Reading.
[25]
Lange D, Oshima M (1999) Seven good reasons for mobile agents. Commun ACM 42:88-89.
[26]
Lee Y, Tien JM (2002) Static and dynamic approaches to modeling end-to end routing in circuit-switched networks. IEEE/ACM Trans Netw 10(5):693-705.
[27]
Lou W, Wu J (2002) On reducing broadcast redundancy in ad hoc wireless networks. IEEE Trans Mobile Comput 1(2):111-123.
[28]
Maes P, Guttman RH, Moukas AG (1999) Agents that buy and sell. Commun ACM 42(3):81-91.
[29]
Milojicic D (2000) Guest editor's introduction: agent systems and applications. IEEE Concurr 8(2):22-23.
[30]
Pleisch S, Schiper A (2003) Fault-tolerant mobile agent execution. IEEE Trans Comput 52(2):209-222.
[31]
Qu W, Shen H, Sum J (2003) New analysis on mobile agents based network routing. In: Proc of the 3rd int'l conf on hybrid intelligent systems (HIS'03), pp 769-778.
[32]
Roughgarden T, Tardos E (2002) How bad is selfish routing? J ACM 49(2):236-259.
[33]
Sheldon T, Linktionary. http://www.linktionary.com/
[34]
Stojmenovic I, Seddigh S, Zunic J (2002) Domination sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans Parallel Distrib Syst 13(1):14-25.
[35]
Sum J, Shen H, Leung C, Young G (2003) Analysis on a mobile agent-based ant algorithm for network routing and management. IEEE Trans Parallel Distrib Syst 14(3):193-202.
[36]
Theilmann W, Rothermel K (2000) Optimizing the dissemination of mobile agents for distributed information filtering. IEEE Concurr, pp 53-61.
[37]
Varga A, OMNeT++: Discrete Event Simulation System: User Manual. http://www.omnetpp.org/
[38]
Webopedia Online Computer Dictionary for Computer and Internet Terms and Definitions. http://www.webopedia.com/
[39]
White T, Pagurek B, Oppacher F, ASGA: improving the ant system by integration with genetic algorithms. In: Proc of the 3rd conf on genetic programming (GP/SGA'98), pp 610-617.
[40]
Xu D, Yin J, Deng Y, Ding J (2003) A formal architectural model for logical agent mobility. IEEE Trans Softw Eng 29(1):31-45.
Recommendations
New analysis on mobile agents based network routing
This paper focuses on behavior analysis on mobile agents used in network routing. We describe a general agent-based routing model and classify it into two cases based on the reaction of mobile agents to a system failure, namely mobile agents with weak ...
The probability of success of mobile agents when routing in faulty networks
APWeb'06: Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and DevelopmentUsing of mobile agents has become an accessible technology in recent years. It is expected to be easier to build robust and fault-tolerant distributed systems by use of mobile agents since they are capable to react dynamically to unfavorable situations ...
New analysis on mobile agents based network routing
Design and application of hybrid intelligent systemsIn this paper, we consider the problem of mobile agent based network routing. We analyze the probability of success (the probability that an agent can find the destination) and the population growth of mobile agents under an ant-routing algorithm. First,...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © Copyright © 2012 Springer Science+Business Media, LLC.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 June 2012
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025