Skip to main content

Economic Path Scheduling for Mobile Agent System on Computer Network

  • Conference paper
  • First Online:
Advanced Techniques in Computing Sciences and Software Engineering
  • 2399 Accesses

Abstract

Mobile agent technology has a lot of gains to offer network-centric applications. The technology promises to be very suitable for narrow-bandwidth networks by reducing network latency and allowing transparent per-to-per computing. Multi-agent technology had been proposed for many network-centric applications with little or no path scheduling algorithms. This paper describes the need for path scheduling algorithms for agents in multi-agent systems. Traveling salesman problem (TSP) scheme is used to model ordered agents and the unordered agents schedule their path based on random distribution. The two types of agents were modeled and simulated based on bandwidth usage and response time as performance metrics. Our simulation results shows that ordered agents have superior performance against unordered agents. The ordered agents exhibit lower bandwidth usage and higher response time.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
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.

Similar content being viewed by others

References

  1. [1] Nehra N, Patel R. B. and Bhat V. K (2007) Distributed Parallel Resource Co-Allocation with Load Balancing in Grid Computing International Journal of Computer Science and Network Security 7(1): 282-291

    Google Scholar 

  2. A. Bieszczad, B. Pagurek, and T. White Mobile Agents for Network Management IEEE Communication Surveys. Available at www.comsoc.org/pubs/surveys [Aug. 10, 2006]

  3. A.S. Torrellas Gustavo and A.V. Vargas Luis Modeling a flexible Network Security Systems Using Multi-Agent Systems: Security Assessment Considerations. Proceedings of the 1st International Symposium on Information and communication technologies pp. 365-371, 2003.

    Google Scholar 

  4. M. F. De Castro, H. Lecarpenttie, L. Merghem and D. Gaiti An Intelligent Network Simulation PlatformEmbedded with Multi-Agents Systems for Next Generation Internet. Telecommunications and Networking-ICT pp. 1317-1326, 2004.

    Google Scholar 

  5. Vogler H., Moschgatt ML, and Kunkelmann T. Enhancing Mobile Agents with Electronic Commerce Capabilities. Proc. Of 2nd International workshop on cooperative Information Agents (CIA-98) pp. 148-159, 1998.

    Google Scholar 

  6. [6]Gabri G. Leonardi L and Zambonelli F. Mobile agent Coordination for Distributed Network Management. Journal of Network Management 9(4): 435-456, 2001.

    Article  Google Scholar 

  7. [7]Boutaba R., Iraqi Y., and Mehaoua A. A Multi-Agent Architecture for QoS Management in Multimedia Networks. Journal of Network and System Management Vol.11 (1): 83-107, 2003.

    Article  Google Scholar 

  8. Baek, J., Kim, J., and Yeom, H.. Timed Mobile Agent Planning for Distributed Information Retrieval Proceedings of the fifth international conference on Autonomous agents pp 120 - 121, 2001.

    Google Scholar 

  9. K. Moizumi and G. Cybenko The Traveling Agent Problem Mathematics of Control, Signals and System, 1998.

    Google Scholar 

  10. [10]Das S., Shuster K., Wu C. and Levit I. Mobile agents for Distributed and Heterogeneous Information Retrieval Information Retrieval 8(3): 383-416, 2005.

    Article  Google Scholar 

  11. [11]Aderounmu G.A. Performance Comparison of remote procedure call and mobile agent approach to control and data transfer in distributed computing environment. Journal of Network and Computer Applications 27, 2004,:pp113-129.

    Article  Google Scholar 

  12. Olajubu E. A, G. A. Aderounmu and E.R. Adagunodo (2008): Optimizing Bandwidth usage and Response Time using Lightweight Agents on Data Communication Network. T. Sobh et al. (eds), Novel Algorithms and Techniques in Telecommunications, Automation and Industrial Electronics, pp. 335-340.

    Google Scholar 

  13. [13]Manvi S. S. and Venkataram P. An Agent-Based Best Effort Routing Technique for Load BalancingInformatica, 2006, Vol. 17, No. 3, 407–426

    MATH  MathSciNet  Google Scholar 

  14. [14]Szczypiorski K, Margasinski I and Mazurczyk W (2007) Steganographic Routing in Multi Agent System Environment . Journal of Information Assurance and Security 2 pp. 235-243.

    Google Scholar 

  15. http://www.csse.monash.edu.au/courseware/cse3142/2006/Lnts/Crng.pdf

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. A. Olajubu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media B.V.

About this paper

Cite this paper

Olajubu, E.A. (2010). Economic Path Scheduling for Mobile Agent System on Computer Network. In: Elleithy, K. (eds) Advanced Techniques in Computing Sciences and Software Engineering. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3660-5_64

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-3660-5_64

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-3659-9

  • Online ISBN: 978-90-481-3660-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics