Journal of Communications and Networks

  • 제8권1호
  • /
  • Pages.123-131
  • /
  • 2006
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

A Heuristic Algorithm for Designing Near-Optimal Mobile Agent Itineraries

  • Gavalas Damianos (Department of Cultural Technology and Communication, University of the Aegean)
  • 발행 : 2006.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when MAs itineraries span multiple subnets. The work presented herein aspires to address these issues. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings.

키워드

참고문헌

  1. W. Stallings, SNMP, SNMPv2, SNMPv3, and RMON 1 and 2, 3-rd ed., Addison Wesley, 1999
  2. A. Fuggeta, G. P. Picco, and G. Vigna, 'Understanding code mobility,' IEEE Trans. Software Engineering, vol. 24, no. 5, pp. 346-361, 1998
  3. T. Du, E. Li, and A. P. Chang, 'Mobile agents in distributed network management,' Commun. the ACM, vol. 46, no. 7, July 2003
  4. A. Liotta, G. Pavlou, and G. Knight, 'Exploiting agent mobility for large scale network monitoring,' IEEE Network, vol. 16, no. 3, pp. 7-15, May/June 2002 https://doi.org/10.1109/MNET.2002.1002994
  5. M. G. Rubinstein, O. C. Duarte, and G. Pujolle, 'Scalability of a mobile agents based network management application,' J. Commun. Networks, vol. 5, no. 3, Sept 2003
  6. R. Stephan, P. Ray, and N. Paramesh, 'Network management platform based on mobile agents,' Int. J. Network Management, vol. 14, pp. 59-73, 2004 https://doi.org/10.1002/nem.508
  7. P. Marques, P. Simoes, L. Silva, F. Boavida, and J. Gabriel, 'Providing applications with mobile agent technology,' in Proc. IEEE OpenArch 2001, Apr. 2001
  8. Present Technologies, 'JAMES project (Java mobile agent platform for the management of telecommunication and data networks),' available at http://www.present-technologies.com/james.jsp
  9. SysteMATech-System Management Based on Mobile Agent Technology, available at http://www.eutist-ami.org/more_systematech.asp
  10. Whitestein Technologies, available at http://www.whitestein.com/pages/index.html
  11. C. Bohoris, A. Liotta, and G. Pavlou, 'Mobile agent based performance management for the virtual home environment,' J. Network and System Management, vol. 11, no. 2, pp. 133-149, June 2003, Kluwer Academic https://doi.org/10.1023/A:1023714931278
  12. T. Chen and S. Liu, 'A model and evaluation of distributed network management applications,' IEEE J. Selected Areas Commun., vol. 20, no. 4, May 2002
  13. D. Gavalas, 'Mobile software agents for network monitoring and performance management,' Ph.D. Thesis, University of Essex, UK, July 2001
  14. A. Iqbal, J. Baumann, and M. StraBer, 'Efficient algorithms to find optimal agent migration strategies,' Universitat Stuttgart, Fakultat Informatik, Bericht Nr. 1998/05, Apr. 1998
  15. E. Reuter, F. Baude, 'System and network management itineraries for mobile agents,' in Proc. MATA 2002 (Lecture Note in Computer Science), vol. 2521, Oct 2002, pp. 227-238
  16. H. Qi and F. Wang, 'Optimal itinerary analysis for mobile agents in ad hoc wireless sensor networks,' in Proc. IEEE Int. Conf. Wireless Commun. 2001, July 2001, pp.147-153
  17. A. Kershenbaum, Telecommunications Network Design Algorithms, McGraw-Hill, 1993
  18. Adventnet, available at http://www.adventnet.com
  19. D. Gavalas, D. Greenwood, M. Ghanbari, and M. O'Mahony, 'Hierarchical network management: A scalable and dynamic mobile agent-based approach,' Computer Networks, vol. 38, no. 6, pp. 693-711, Apr. 2002 https://doi.org/10.1016/S1389-1286(01)00277-8
  20. D. Gavalas, 'Mobile agent platform design optimisations for minimising network overhead and latency in agent migrations,' in Proc. Globecom 2004, Dec. 2004
  21. JADE (Java agent development framework), available at http://jade.tilab.com/
  22. Java 2 Platform, Standard Edition (J2SE), available at http://java.sun.com/j2se/
  23. K. McCloghrie and M. Rose, 'Management information base for network management of TCP/IP-based Internets: MIB-II,' RFC 1213, Mar. 1991
  24. UCD-SNMP project, available at http://www.ece.ucdavis.edu/ucd-snmp/
  25. WinDump: tcpdump for Windows, available at http://windump.polito.it/
  26. Aglets Mobile Agent Platform, available at http://www.trl.ibm.com/aglets/
  27. The Network Simulator-NS-2, available at http://www.isi.edu/nsnam/ns/
  28. E. W. Zegura, K. L. Calvert, and M. J. Donahoo, 'A quantitative comparison of graph-based models for Internet topology,' IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 770-783, Dec. 1997 https://doi.org/10.1109/90.650138