Skip to Main content Skip to Navigation
Theses

Marches aléatoires et mot circulant, adaptativité et tolérance aux pannes dans les environnements distribués.

Abstract : We propose in this work a study of the random walks in the distributed algorithms for dynamic networks. We first show that random walks are a viable tool for the design of distributed algorithms. These algorithms are based on the three fundamental properties of the random walks (Percussion, Coverrage, Meeting). We provide a method which evaluates elapsed time before these properties are checked. This method enables us to evaluate complexity of our algorithms. In the second time, we propose the use of a token circulating randomly as a circulating word in order to collect on this token topological information on a message. This information allows the construction and the maintenance of a covering structure of the communication network. Then, we used this structure to design a fault-tolerant algorithm of token circulation in the dynamic environments. This algorithm is completely decentralized. We propose in a last time to adapt our token circulation to propose a solution to the resource allocation problem in the ad-hoc networks.
Complete list of metadata

Cited literature [80 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00143600
Contributor : Thibault Bernard <>
Submitted on : Thursday, April 26, 2007 - 11:18:06 AM
Last modification on : Friday, May 17, 2019 - 11:40:04 AM
Long-term archiving on: : Friday, September 21, 2012 - 2:25:22 PM

Identifiers

  • HAL Id : tel-00143600, version 1

Collections

Citation

Thibault Bernard. Marches aléatoires et mot circulant, adaptativité et tolérance aux pannes dans les environnements distribués.. Réseaux et télécommunications [cs.NI]. Université de Reims - Champagne Ardenne, 2006. Français. ⟨tel-00143600⟩

Share

Metrics

Record views

198

Files downloads

1178