Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network
| dc.contributor.advisor | Cyril Gavoille | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| hal.structure.identifier | Combinatoire et Algorithmique | |
| dc.contributor.author | KOSOWSKI, Adrian | |
| dc.date.accessioned | 2024-04-15T09:42:54Z | |
| dc.date.available | 2024-04-15T09:42:54Z | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/197717 | |
| dc.description.abstractEn | 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. | |
| dc.language.iso | en | |
| dc.subject.en | Distributed Algorithm | |
| dc.subject.en | Mobile Agent | |
| dc.subject.en | Anonymous Network | |
| dc.subject.en | Graph Exploration | |
| dc.subject.en | Rendezvous in Graphs | |
| dc.subject.en | Random Walk | |
| dc.subject.en | Metropolis Walk | |
| dc.subject.en | Rotor-Router Walk | |
| dc.subject.en | Universal Traversal Sequence | |
| dc.subject.en | De-rendomization | |
| dc.title.en | Time and Space-Efficient Algorithms for Mobile Agents in an Anonymous Network | |
| dc.type | HDR | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| dc.subject.hal | Informatique [cs]/Algorithme et structure de données [cs.DS] | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.type.institution | Université Sciences et Technologies - Bordeaux I | |
| hal.identifier | tel-00867765 | |
| hal.version | 1 | |
| hal.origin.link | https://hal.archives-ouvertes.fr//tel-00867765v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=KOSOWSKI,%20Adrian&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||