Skip to main content
SpringerLink
Log in

Statistical behaviors of mobile agents in network routing

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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

    Article  Google Scholar 

  6. Bieszczad A, Pagurek B, White T (1998) Mobile agents for network management. IEEE Commun Surv 1(1):2–9

    Article  Google Scholar 

  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

    Google Scholar 

  8. Calvert KL, Doar MB, Zegura EW (1997) Modelling Internet topology. IEEE Commun Mag 35(6):160–163

    Article  Google Scholar 

  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

    Article  Google Scholar 

  10. Caro GD, Dorigo M (1998) AntNet: distributed stigmergetic control for communications networks. J Artif Intell Res 9:317–365

    MATH  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  14. Du TC, Li EY, Chang AP (2003) Mobile agents in distributed network management. Commun ACM 46(7):127–132

    Article  Google Scholar 

  15. Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York

    MATH  Google Scholar 

  16. Goss S, Aron S, Deneubourg JL, Pasteels JM (1989) Self-organized shortcuts in the Argentine ant. Naturwissenschaften 79:579–581

    Article  Google Scholar 

  17. He M, Jennings NR, Leung H (2003) On agent-mediated electronic commerce. IEEE Trans Know Data Eng 15(4):985–1003

    Article  Google Scholar 

  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

    Article  Google Scholar 

  19. Hőlldobler B, Wilson EO (1990) The Ants. Springer, Berlin

    Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  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

    Article  Google Scholar 

  23. Karjoth G, Lange D, Oshima M (1997) A security model for aglets. IEEE Internet Comput 1(4):68–77

    Article  Google Scholar 

  24. Lange D, Oshima M (1998) Programming and Developing Java Mobile Agents with Aglets. Addison-Wesley, Reading

    Google Scholar 

  25. Lange D, Oshima M (1999) Seven good reasons for mobile agents. Commun ACM 42:88–89

    Article  Google Scholar 

  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

    Article  Google Scholar 

  27. Lou W, Wu J (2002) On reducing broadcast redundancy in ad hoc wireless networks. IEEE Trans Mobile Comput 1(2):111–123

    Article  Google Scholar 

  28. Maes P, Guttman RH, Moukas AG (1999) Agents that buy and sell. Commun ACM 42(3):81–91

    Article  Google Scholar 

  29. Milojicic D (2000) Guest editor’s introduction: agent systems and applications. IEEE Concurr 8(2):22–23

    Article  Google Scholar 

  30. Pleisch S, Schiper A (2003) Fault-tolerant mobile agent execution. IEEE Trans Comput 52(2):209–222

    Article  Google Scholar 

  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

    Article  MathSciNet  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

  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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Dalian Maritime University, 1 Linghai Road, Ganjinzi District, Dalian, 116026, China

    Wenyu Qu

  2. Department of Computer Science and Engineering, Dalian University of Technology, 1 Linggong Road, Ganjinzi District, Dalian, 116024, China

    Keqiu Li

  3. Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo, 153-8505, Japan

    Wenyu Qu & Masaru Kitsuregawa

  4. School of Management, Liaoning Normal University, 850 Huanghe Road, Dalian, 116029, China

    Weilian Xue

Authors
  1. Wenyu Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keqiu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Masaru Kitsuregawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Weilian Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Keqiu Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qu, W., Li, K., Kitsuregawa, M. et al. Statistical behaviors of mobile agents in network routing. J Supercomput 60, 360–388 (2012). https://doi.org/10.1007/s11227-008-0220-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-008-0220-2

Keywords

Search

Navigation