Mobile Agents Implementing Local Computations in Graphs

  • Bilel Derbel
  • Mohamed Mosbah
  • Stefan Gruner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5214)

Abstract

Mobile agents are a well-known paradigm for the design and implementation of distributed systems. However, whilst their popularity continues to grow, a uniform theory of mobile agent systems is not yet sufficiently elaborated, in comparison with classical models of distributed computation. In this paper we show how to use mobile agents as an alternative model for implementing distributed local computation rules. In doing so, we approach a general and unified framework for local computations which is consistent with the classical theory of distributed computations based on graph relabeling systems.

Keywords

Distributed algorithms Mobile agents Relabeling systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin, D.: Local and global properties in networks of processors. In: 12th Symposium on theory of computing, pp. 82–93 (1980)Google Scholar
  2. 2.
    Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: From local computations to asynchronous message passing systems. Technical Report, LaBRI, RR-1271-02 (2002)Google Scholar
  3. 3.
    Bauderon, M., Mosbah, M.: A unified framework for designing, implementing and visualizing distributed algorithms. In: Bottoni, P., Minas, M. (eds.) Graph Transformation and Visual Modeling Techniques (GT-VMT 2002), Barcelona, Spain. Electronic Notes in Theoretical Computer Science, vol. 72 (2003)Google Scholar
  4. 4.
    Chalopin, J., Godard, E., Métivier, Y., Ossamy, R.: Mobile agent algorithms versus message passing algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187–201. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Chalopin, J., Paulusma, D.: Graph labelings derived from models in distributed computing. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 301–312. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Gruner, S.: Mobile agent systems and cellular automata. Technical Report 1400-06, LaBRI - University of Bordeaux 1 (2006)Google Scholar
  7. 7.
    Hibaoui, A.E., Métivier, Y., Robson, J., Saheb-Djahromi, N., Zemmari, A.: Analysis of a randomized dynamic timetable handshake algorithm. Technical Report 1402-06, LaBRI (2006)Google Scholar
  8. 8.
    Knirsch, P., Kreowski, H.-J.: A note on modeling agent systems by graph transformation. In: Münch, M., Nagl, M. (eds.) AGTIVE 1999. LNCS, vol. 1779, pp. 79–86. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Litovsky, I., Métivier, Y., Sopena, E.: Different local controls for graph relabelling systems. Math. Syst. Theory 28, 41–65 (1995)MATHCrossRefGoogle Scholar
  10. 10.
    Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. 3, pp. 1–56. World Scientific, Singapore (1999)Google Scholar
  11. 11.
    Litovsky, I., Métivier, Y., Zielonka, W.: On the Recognition of Families of Graphs with Local Computations. Inf. and Comp. 118(1), 110–119 (1995)MATHCrossRefGoogle Scholar
  12. 12.
    Métivier, Y., Saheb, N., Zemmari, A.: Randomized rendez vous. In: Mathematics and computer science: Algorithms, trees, combinatorics and probabilities, Trends in mathematics, pp. 183–194. Birkhäuser, Basel (2000)Google Scholar
  13. 13.
    Métivier, Y., Saheb, N., Zemmari, A.: Randomized local elections. Information Processing Letters 82, 313–320 (2002)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Métivier, Y., Saheb, N., Zemmari, A.: Analysis of a randomized rendez vous algorithm. Information and Computation 184, 109–128 (2003)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Ossamy, R.: An algorithmic and computational approach to local computations. In: Ph. D Thesis. LaBRI, University of Boredaux 1, France (December 2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Bilel Derbel
    • 1
  • Mohamed Mosbah
    • 2
  • Stefan Gruner
    • 3
  1. 1.Laboratoire d’Informatique Fondamentale de Lille (LIFL)Université des Sciences et Technologies de Lille 1France
  2. 2.Laboratoire Bordelais de Recherche en Informatique (LaBRI)Université Bordeaux 1/ENSEIRBFrance
  3. 3.Department of Computer ScienceUniversity of PretoriaSouth Africa

Personalised recommendations