Skip to Main content Skip to Navigation
Theses

Self-stabilizing algorithms for graph parameters

Brahim Neggazi 1, 2
Abstract : The concept of self-stabilization was first introduced by Dijkstra in 1973. A distributed system is self-stabilizing if it can start from any possible configuration and converges to a desired configuration in finite time by itself without using any external intervention. Convergence is also guaranteed when the system is affected by transient faults. This makes self-stabilization an effective approach for non-masking fault-tolerance. The self-stabilization was studied in various fields in distributed systems such as the problems of clock synchronization, communication and routing protocols. Given the importance of graph parameters, especially for organization and communication of networks and distributed systems, several self-stabilizing algorithms for classic graph parameters have been developed in this direction, such as self-stabilizing algorithms for finding minimal dominating sets, coloring, maximal matching, spanning tree and so on. Thence, we propose in this thesis, distributed and self-stabilizing algorithms to some wellknown graphs problems, particularly for graph decompositions and dominating sets problems that have not yet been addressed in a view of self-stabilization. The four major problems considered in this thesis are: the partitioning into triangles, p-star decomposition, edge monitoring set and independent strong dominating set problems. The common point between these four problems is that they are considered as variants of dominating set and matching problems and all propositions deal with the self-stabilization paradigm
Document type :
Theses
Complete list of metadata

Cited literature [124 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01303138
Contributor : Abes Star :  Contact
Submitted on : Saturday, April 16, 2016 - 1:01:45 AM
Last modification on : Tuesday, June 1, 2021 - 2:08:09 PM
Long-term archiving on: : Sunday, July 17, 2016 - 10:10:16 AM

File

TH2015NeggaziBrahim.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01303138, version 1

Citation

Brahim Neggazi. Self-stabilizing algorithms for graph parameters. Computational Geometry [cs.CG]. Université Claude Bernard - Lyon I, 2015. English. ⟨NNT : 2015LYO10041⟩. ⟨tel-01303138⟩

Share

Metrics

Record views

510

Files downloads

1102