Advertisement

An Infrastructure-Based Approach to Support Dynamic Networks with Mobile Agents

  • Arndt Döhler
  • Christian Erfurth
  • Wilhelm Rossak
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3457)

Abstract

With the growing size of distributed systems and the higher number of available resources and services in networks dynamical aspects become more and more important in systems engineering. We believe that there is a real need for decentral, self-organizing structures to cope with the upcoming challenges. In this paper we describe a framework which provides a self-organizing infrastructure that allows to link otherwise autonomous elements in a flexible way and adapts dynamically to changes in the underlying network. This framework is implemented as an extension of the mobile agent system Tracy, which is also a product of our university. The Tracy Domain Management module is part of the framework and provides the basis for segmenting the infrastructure. Another module we are going to discuss in this paper facilitates autonomous and proactive routing of mobile agents. Agents form the application layer of the system. Routing is triggered by the needs an agent inherits from its owner and then matched to the resources and services available in the network in an iterative fashion. We describe concepts, design issues and first results of our work with Tracy and the use of these additional Tracy modules.

Keywords

Distributed systems self-organization rule-based behavior proactive navigation of mobile agents mobile agent systems 

References

  1. 1.
    Vigna, G.: Mobile Code Technologies, Paradigms, and Applications. PhD thesis, Politecnico di Milano (1998)Google Scholar
  2. 2.
    Friedrich-Schiller-Universität Jena, Software Engineering Group: Tracy – The Mobile Agent System (2004), http://tracy.informatik.uni-jena.de
  3. 3.
    Braun, P., Erfurth, C., Rossak, W.: An Introduction to the Tracy Mobile Agent System. Technical Report Math/Inf/00/24, Friedrich-Schiller-Universität Jena, Institut für Informatik (2000)Google Scholar
  4. 4.
    Erfurth, C., Rossak, W.: Characterization and Management of Dynamical Behaviour in a System With Mobile Agents. In: Unger, H., Böhme, T., Mikler, A. (eds.) IICS 2002. LNCS, vol. 2346, pp. 109–119. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Braun, P.: The Migration Process of Mobile Agents - Implementation, Classification, and Optimization. PhD thesis, Friedrich-Schiller-Universität Jena, Institut für Informatik (2003)Google Scholar
  6. 6.
    Braun, P., Eismann, J., Rossak, W.: A Multi-Agent Approach To Manage a Network of Mobile Agent Servers. Technical Report 12/01, Friedrich-Schiller-Universität Jena, Institut für Informatik (2001)Google Scholar
  7. 7.
    Fensch, C.: Class Splitting as a Method to Reduce Network Traffic in a Mobile Agent System. Master’s thesis, Friedrich-Schiller-Universität Jena, Institut für Informatik (2001)Google Scholar
  8. 8.
    Schaaf, M.: Entwicklung und Implementierung einer Komponente zur Migrationsoptimierung für Mobile Agenten. Master’s thesis, Friedrich-Schiller-Universität Jena, Institut für Informatik (2003)Google Scholar
  9. 9.
    Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell System Technical Journal 44, 2245–2269 (1965)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Johnson, D.S., McGeoch, L.A.: The Traveling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorical Optimization, pp. 215–310. John Wiley and Sons, Ltd., Chichester (1997)Google Scholar
  11. 11.
    Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovitch, A.: Experimental analysis of heuristics for the atsp. [14], 445–487 Google Scholar
  12. 12.
    Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the stsp. [14], 369–444 Google Scholar
  13. 13.
    Cirasella, J., Johnson, D.S., McGeoch, L.A., Zhang, W.: The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, p. 32. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Dordrecht (2002)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Arndt Döhler
    • 1
  • Christian Erfurth
    • 1
  • Wilhelm Rossak
    • 1
  1. 1.Computer Science Dept.Friedrich-Schiller-University, JenaJenaGermany

Personalised recommendations