Skip to main content
SpringerLink
Log in

The Probability of Success of Mobile Agents When Routing in Faulty Networks

  • Conference paper
Book cover Frontiers of WWW Research and Development - APWeb 2006 (APWeb 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3841))

Included in the following conference series:

Abstract

Using 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 and events. In this paper, we consider about the problem of using mobile agents for routing in faulty networks. We propose two mobile agent-based routing models and compared their probability of success (the probability that an agent can find the destination).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abbattista, F., Paradiso, A., Semeraro, G., Zambetta, F.: An Agent that Learns to Support Users of a Web Site. Applied Soft Computing 4(1), 1–12 (2004)

    Article  Google Scholar 

  2. Beckers, R., Deneubourg, J.L., Goss, S.: Trails and U-turns in the selection of the shortest path by the ant Lasius niger. Jorunal of Theoretical Biology 159, 397–415 (1992)

    Article  Google Scholar 

  3. Brazier, F.M.T., Overeinder, B.J., Steen, M., Wijngaards, N.J.E.: Agent Factory: Generative migration of Mobile Agents in Heterogeneous Environments. In: Proc. of the ACM Symp. on Applied Computing (SAC 2002), pp. 101–106 (2002)

    Google Scholar 

  4. Brewington, B., Gray, R., Moizumi, K., Kotz, D., Cybenko, G., Rus, D.: Mobile Agents in Distributed Information Retrieval. In: Klusch, M. (ed.) Intelligent Information Agents: Agents-Based Information Discovery and Management on the Internet, ch. 15, pp. 355–395. Springer-, Heidelberg (1999)

    Google Scholar 

  5. Caro, G.D., Dorigo, M.: AntNet: A Mobile Agents Approach to Adaptive Routing. Tech. Rep. IRIDIa/97-12, Universite Libre de Bruxelles, Belgium (1997)

    Google Scholar 

  6. Claessens, J., Preneel, B., Vandewalle, J. (How) Can Mobile Agents Do Secure Electronic Transactions on Untrusted Hosts? A Survey of the Security Issues and the Current Solutions. ACM Trans. on Internet Technology 3(1), 28–48 (2003)

    Article  Google Scholar 

  7. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43, 73–81 (1997)

    Article  Google Scholar 

  8. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theorey of NP-Completeness. Freeman, New York (1979)

    Google Scholar 

  9. Goss, S., Aron, S., Deneubourg, J.L., Pasteels, J.M.: Self-Organized Shortcuts in the Argentine Ant. Naturwissenschaften 76, 579–581 (1989)

    Article  Google Scholar 

  10. Karjoth, G., Lange, D., Oshima, M.: A Security Model for Aglets. IEEE Internet Computing 1(4), 68–77 (1997)

    Article  Google Scholar 

  11. Lange, D., Oshima, M.: Seven Good Reasons for Mobile Agents. Communications of the ACM 42, 88–89 (1999)

    Article  Google Scholar 

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

    Google Scholar 

  13. Lee, Z.J., Lee, C.Y., Su, S.F.: An Immunity-Based Ant Colony Optimization Algorithm for Solving Weapon-Target Assignment Problem. Applied Soft Computing 2(1), 39–47 (2002)

    Article  MathSciNet  Google Scholar 

  14. Li, T., Lam, K.: An Optimal Location Update and Searching Algorithm for Tracking Mobile Agent. In: AAMAS 2002, Bologna, Italy, pp. 15–19 (July 2002)

    Google Scholar 

  15. Moore, J.H., Hahn, L.W., Ritchie, M.D., Thornton, T.A., White, B.C.: Routine discovery of complex genetic models using genetic algorithms. Applied Soft Computing 4(1), 79–86 (2004)

    Article  Google Scholar 

  16. Qu, W., Shen, H., Sum, J.: New Analysis on Mobile Agents Based Network Routing. In: Proc. of the 3rd Int’l Conf. on Hybrid Intelligence Systems (HIS 2003), pp. 769–778 (2003) (Best Student Paper Award)

    Google Scholar 

  17. Schoonderwoerd, R., Holland, O., Bruten, J.: Ant-like Agents for Load Balancing in Telecommunications Networks. In: Proc. of Agents 1997, Marina del Rey, CA, pp. 209–216. ACM Press, New York (1997)

    Chapter  Google Scholar 

  18. Sum, J., Shen, H., Leung, C.S., Young, G.: Analysis on Mobile-Agent Based Algorithm for Network Routing and Management. IEEE Tran. on Paralell and Distributed Systems 14(3), 193–202 (2003)

    Article  Google Scholar 

  19. Tang, L., Pagurek, B.: A Comparative Evaluation of Mobile Agent Performance for Network Management. In: Proc. of the 9th Annual IEEE Int’l Conf. and Wksp. on the Engineering of Computer-Based Systems(ECBS 2002), pp. 258–267 (2002)

    Google Scholar 

  20. Wang, Y.: Dispatching Multiple Mobile Agents in Parallel for Visiting E-Shops. In: Proc. of the 3rd Int’l Conf. on Mobile Data Management(MDM 2002), pp. 61–68 (2002)

    Google Scholar 

  21. 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 1998), pp. 610–617 (1998)

    Google Scholar 

  22. White, T., Pagurek, B., Oppacher, F.: Connection Management Using Adaptive Agents. In: Proc. of the Int’l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA 1998), pp. 802–809 (1998)

    Google Scholar 

  23. Wong, D., Paciorek, N., Moore, D.: Java-Based Mobile Agents. Communications of the ACM 42, 92–102 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Japan Advanced Institute of Science and Technology,  

    Wenyu Qu & Hong Shen

Authors
  1. Wenyu Qu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of ITEE, The University of Queensland, Australia

    Xiaofang Zhou

  2. School of Computer Science and Technology, Heilongjiang University, China

    Jianzhong Li

  3. School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, QLD, Australia

    Heng Tao Shen

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

    Masaru Kitsuregawa

  5. Victoria University, Australia

    Yanchun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qu, W., Shen, H. (2006). The Probability of Success of Mobile Agents When Routing in Faulty Networks. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds) Frontiers of WWW Research and Development - APWeb 2006. APWeb 2006. Lecture Notes in Computer Science, vol 3841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610113_8

Download citation

  • DOI: https://doi.org/10.1007/11610113_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31142-3

  • Online ISBN: 978-3-540-32437-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation