Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
KOSOWSKI, Adrian
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Combinatoire et Algorithmique
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Combinatoire et Algorithmique
KOSOWSKI, Adrian
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Combinatoire et Algorithmique
< Réduire
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Combinatoire et Algorithmique
Langue
en
HDR
Résumé en anglais
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 ...Lire la suite >
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.< Réduire
Mots clés en anglais
Distributed Algorithm
Mobile Agent
Anonymous Network
Graph Exploration
Rendezvous in Graphs
Random Walk
Metropolis Walk
Rotor-Router Walk
Universal Traversal Sequence
De-rendomization
Origine
Importé de halUnités de recherche