Self-stabilizing algorithms for spanning tree construction and for the management of mobile entities

In the context of large-scale networks, the consideration of faults is an evident necessity. This document is focussing on the self-stabilizing approach which aims at conceiving algorithms ''repairing themselves'' in case of transient faults, that is of faults implying an arbitrary modification of the states of the processes. The document focuses on two different contexts, covering the major part of my research work these last years. The first part of the document is dedicated to the design and analysis of self-stabilizing algorithms for networks of processes. The second part of the document is dedicated to the design and analysis of self-stabilizing algorithms for autonomous entities (i.e., software agents, robots, etc.) moving in a network.

Data and Resources

Additional Info

Field Value
Source https://theses.hal.science/tel-00847179
Author Blin, Lélia
Maintainer CCSD
Last Updated May 10, 2026, 06:28 (UTC)
Created May 10, 2026, 06:28 (UTC)
Identifier tel-00847179
Language fr
Rights https://about.hal.science/hal-authorisation-v1/
contributor Networks and Performance Analysis (NPA) ; Laboratoire d'Informatique de Paris 6 (LIP6) ; Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)
creator Blin, Lélia
date 2011-12-01T00:00:00
harvest_object_id ed11b31b-e179-499b-a9e0-7ae4b7c46157
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2025-08-12T00:00:00
set_spec type:HDR