Skip to main content

A novel mobile Agent search algorithm

  • Sesion 5: Mobility and Persistence
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1219))

Abstract

Intelligent Agent has been shown to be a good approach to addressing the issues of mobile computing. However, before the approach can be commercially viable, a set of management capabilities that support the controls of intelligent agents in a mobile environment need to be in place. Since controls can only be applied after the target agent is located, an effective agent search algorithm is an indispensable part of the management functions. In this paper, we propose a new algorithm, the Highest Probability First Algorithm, for locating the target agent. The approach makes use of the execution time information to reduce cost and network traffic. The execution time of the agent on a server is assumed to be binomial distributed and therefore is more realistic.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Weiser. Some Computer Science Issues in Ubiquitous Computing. Communications of the ACM, 36(7):75–84, July 1993.

    Google Scholar 

  2. G. H. Forman and J. Zahorjan. The Challenges of Mobile Computing. IEEE Computer, pages 38–47, March 1994.

    Google Scholar 

  3. T. Imielinski and B. R. Badrinat. Mobile Wireless Computing: Challenges in Data Managemen. Communication of the ACM, August 1994.

    Google Scholar 

  4. M. Wooldridge and N. R. Jennings, editors. Intelligent Agents: Theories, Architectures, and Languages. Springer-Verlag Lecture Notes in AI-vol. 890, 1995.

    Google Scholar 

  5. M. Wooldridge and N. R. Jennings, editors. Intelligent Agents II: Theories, Architectures, and Languages. Springer-Verlag Lecture Notes in AI-vol. 1037, 1996.

    Google Scholar 

  6. N. Jennings and M. Wooldridge. Software Agent. IEEE Personal Communications Magazine, pages 17–20, Janurary 1996.

    Google Scholar 

  7. J. E. White. Telescript Technology: The Foundation of the Electronic Marketplace. White paper, General Magic, 1994.

    Google Scholar 

  8. W.-S. E. Chen and Y.-N. Lien. Intelligent Messaging for Mobile Computing over the World-Wide Web. In Proceedings of the Second Workshop on Mobile Computing, April 1995.

    Google Scholar 

  9. Y.-N. Lien. An Open Intelligent Messaging Network Infrastructure for Ubiquitous Information Service. In Proceedings of the First Workshop on Mobile Computing, April 1995.

    Google Scholar 

  10. Y.-N. Lien and C.-W. R. Leng. On the Search of Mobile Agents. In Proceedings of the 7th IEEE Symp. of Personal, Indoor, and Radio Communications, October 1996.

    Google Scholar 

  11. R. Jain. The Art of Computer System Performance Analysis. John Wiley & Sons, Inc., 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Kurt Rothermel Radu Popescu-Zeletin

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, WS.E., Leng, CW.R. (1997). A novel mobile Agent search algorithm. In: Rothermel, K., Popescu-Zeletin, R. (eds) Mobile Agents. MA 1997. Lecture Notes in Computer Science, vol 1219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62803-7_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-62803-7_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-68695-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics