Skip to main content
Log in

Analysis on Extended Ant Routing Algorithms for Network Routing and Management

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

Abstract

Advances in mobile agent research have brought in a new method for network routing, ant routing. Recently, we have derived some preliminary results regarding the agent population growth property and the jumping behavior for an ant routing algorithm. The focus was on the expected number of agents in a node. In practice, the number of agents propagating on each network channel is also critical as the network channel bandwidth is limited. In this paper, we first propose two extended ant routing algorithms, and then provide an in-depth analysis on the population growth behavior of the propagating agents for these algorithms, both at nodes (hosts) and on edges (channels) of the network.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. Bakshi, P. Krishna, N. Vaidya and D. Pradhan. Improving performance of TCP over wireless networks, Department of Computer Science, Texas A&M University, Technical Report 96-014, May 1996.

  2. H. Balakrishnan, S. Seshan, E. Amir, and R. Katz. Improving TCP/IP performance over wireless networks, In Proc. 1st ACM International Conf. on Mobile Computing and Networking (Mobicom), pp. 2-11, Nov. 1995.

  3. A. Bieszczad, T. White, and B. Pagurek. Mobile agents for network management. IEEE Communications Surveys, 1(1):2-9, September 1998.

    Google Scholar 

  4. R. Bronson. Matrix Operation, Schaum's Outline Series, McGraw Hill, 1989.

  5. B. Bullnheimer, R. F. Hartl, and C. Strauss. Applying the ant system to the vehicle routing problem. In Proceedings of the 2nd Metaheuristics International Conference (MIC-97), Sophia-Antipolis, France.

  6. L. Cardelli, A Language with distributed scope. In Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 286-297, 1995.

  7. G. Di Caro and M. Dorigo. AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, Université Libre de Bruxelles, Belgium, 1997.

    Google Scholar 

  8. F. Douglis and J. Ousterhout. Transparent process migration: design alternatives and the sprite implementation. Software Practice and Experience, 21(8):757-785, August 1991.

    Google Scholar 

  9. M. El-Darieby and A. Bieszczad. Intelligence mobile agents: Towards network fault management automation. In Proceedings of Sixth IFIP/IEEE International Symposium on Integrated Network Management, pp. 611-622, May 1999.

  10. R. Gray. Agent Tcl: A flexible and secure mobile-agent system. In Proceedings of the Fourth Annual Tcl/Tk Workshop (TCL '96), pp. 9-23, July 1996.

  11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.

    Google Scholar 

  12. C. Harrison, D. M. Chess, and A. Kershenbaum. Mobile agents: are they a good idea? Technical Report, IBM Research Division, T. J. Watson Research Center, March 1995. (http://www.research.ibm.com/massdist/mobag.ps).

  13. J. Hylton, K. Manheimer, F. L. Drake Jr., B. Warsaw, R. Masse, and G. van Rossum. Knowbot programming: System support for mobile agents. In Proceedings of the Fifth International Workshop on Object Orientation in Operating Systems (IWOOOS '96), pp. 8-13, October 1996.

  14. D. Johansen, R. van Renesse, and F. B. Schneider. An introduction to the TACOMA distributed system. Technical Report 95-23, Department of Computer Science, University of Tromso, June 1995.

  15. E. Jul, H. Levy, N. Hutchinson, and A. Black. Fine-grained mobility in the emerald system. ACM Transactions on Computer Systems, 6(1):109-133, February 1988.

    Google Scholar 

  16. G. Karjoth, D. Lange, and M. Oshima. A security model for Aglets. IEEE Internet Computing, 1(4):68-77, July-August 1997.

    Google Scholar 

  17. N. Karnik and R. Tripathi. Design issues in mobile-agent programming systems, IEEE Concurrency, 6(3):52-61, July-Sept. 1998.

    Google Scholar 

  18. D. Lange and M. Oshima. Programming and Deploying Java Mobile Agents with Aglets, Addison Wesley, 1998.

  19. A. Lingnau, O. Drobnik, and P. Domel. An HTTP-based infrastructure for mobile agents. In Proceedings of the Fall 1995 WWW Conference, pp. 461-471, December 1995.

  20. C. Munday, J. Dangedej, T. Cross, D. Lukose. Motivation and perception mechanisms in mobil agent for electronic commerce. In Proceedings of the First Australian Workshop on Distributed Artificial Intelligence, LNAI, Vol. 1087, pp. 144-158, Springer, November 1996.

    Google Scholar 

  21. ObjectSpace. ObjectSpace voyager core package technical overview. Technical Report, ObjectSpace, Inc., July 1997.

  22. M. Ranganathan, A. Acharya, S. Sharma, and J. Saltz. Network-aware mobile programs. In Proceedings of USENIX'97, 91-103, January 1997.

  23. C. Perkins. Providing continuous network access to mobile hosts using TCP/IP. Computer Networks and ISDN Systems, 26(3):357-369, November 1993.

    Google Scholar 

  24. J. Soloman. Mobile IP: The Internet Unplugged, Prentice Hall, 1998.

  25. C. Schramm, A. Bieszczad, and B. Pagurek. Application-oriented network modeling with Mobile agents. In Proceedings of the IEEE/IFIP Network Operations and Management Symposium NOMS'98, New Orleans, Louisiana, February 1998.

  26. A. S. Tanenbaum. Computer Networks, 3rd Ed., Prentice Hall, 1996.

  27. M. Taylor, W. Waung and M. Banan. Internetworking Mobility: The CDPD Approach, Prentice Hall, 1997.

  28. T. Thorn. Programming languages for mobile code. ACM Computing Surveys, 29(3):213-239, September 1997.

    Google Scholar 

  29. P. Wayner. Agents away, Byte, May, 1994.

  30. J. White. Mobile Agents. Technical report, General Magic. Available at URL http://www.genmagic.com/Telescript/, October 1995.

  31. T. White. Routing with swarm intelligence, Technical Report SCE-97-15, Systems and Computer Engineering, Carleton University, September 1997.

  32. T. White, B. Pagurek, and F. Oppacher. ASGA: Improving the ant system by integration with genetic algorithms. In Proceedings of the 3rd Conference on Genetic Programming (GP/SGA '98), pp. 610-617, July 1998.

  33. T. White, B. Pagurek, and F. Oppacher. Connection management using adaptive agents. In Proceedings of 1998 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'98), pp. 802-809, July 1998.

  34. T. White and B. Pagurek. Towards multi-swarm problem solving in networks. In Proceedings of the 3rd International Conference on Multi-Agent Systems (ICMAS '98), pp. 333-340, July 1998.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sum, J., Shen, H., Young, G. et al. Analysis on Extended Ant Routing Algorithms for Network Routing and Management. The Journal of Supercomputing 24, 327–340 (2003). https://doi.org/10.1023/A:1022088915084

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022088915084

Navigation