Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network - TEL - Thèses en ligne Access content directly
Habilitation À Diriger Des Recherches Year : 2013

Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network

Abstract

Computing with mobile agents is rapidly becoming a topic of mainstream research in the theory of distributed computing. The main research questions undertaken in this study concern the feasibility of solving fundamental tasks in an anonymous network, subject to limitations on the resources available to the agent. The considered challenges include: exploring a graph by means of an agent with limited memory, discovery of the network topology, and attempting to meet with another agent in another network (rendezvous). The constraints imposed on the agent include the number of moves which the agent is allowed to perform in the network, the amount of state memory available to the agent, the ability of the agent to communicate with other agents, as well as its a priori knowledge of the network topology or of global parameters.
Fichier principal
Vignette du fichier
hdr.pdf (1.13 Mo) Télécharger le fichier
Loading...

Dates and versions

tel-00867765 , version 1 (30-09-2013)

Identifiers

  • HAL Id : tel-00867765 , version 1

Cite

Adrian Kosowski. Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network. Distributed, Parallel, and Cluster Computing [cs.DC]. Université Sciences et Technologies - Bordeaux I, 2013. ⟨tel-00867765⟩
939 View
942 Download

Share

Gmail Mastodon Facebook X LinkedIn More