Skip to Main content Skip to Navigation
Reports

Mobile Agents For Implementing Local Computations in Graphs

Abstract : Mobile agents are a recent paradigm to facilitate the design and programming of distributed applications. 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.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00273765
Contributor : Bilel Derbel <>
Submitted on : Wednesday, April 16, 2008 - 2:40:05 PM
Last modification on : Tuesday, May 12, 2020 - 5:26:09 PM
Document(s) archivé(s) le : Friday, November 25, 2016 - 9:38:58 PM

File

RR-6506.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00273765, version 2

Citation

Bilel Derbel, Stefan Gruner, Mohamed Mosbah. Mobile Agents For Implementing Local Computations in Graphs. [Research Report] RR-6506, INRIA. 2008, pp.17. ⟨inria-00273765v2⟩

Share

Metrics

Record views

440

Files downloads

784