HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Efficient distributed algorithms suited for uncertain context

Abstract : Distributed systems become increasingly wide and complex, while their usage extends to various domains (e.g., communication, home automation, monitoring, cloud computing). Thus, distributed systems are executed in diverse contexts. In this thesis, we focus on uncertain contexts, i.e., the context is not completely known a priori or is unsettled. More precisely, we consider two main kinds of uncertainty: processes that are not completely identified and the presence of faults. The absence of identification is frequent in large networks composed of massively produced and deployed devices. In addition, anonymity is often required for security and privacy. Similarly, large networks are exposed to faults (e.g, process crashes, wireless connection drop), but the service must remain available.This thesis is composed of four main contributions. First, we study the leader election problem in unidirectional rings of homonym processes, i.e., processes are identified but their ID is not necessarily unique. Then, we propose a silent self-stabilizing leader election algorithm for arbitrary connected network. This is the first algorithm under such conditions that stabilizes in a polynomial number of steps. The third contribution is a new stabilizing property designed for dynamic networks that ensures fast and gradual convergences after topological changes. We illustrate this property with a clock synchronizing algorithm. Finally, we consider the issue of concurrency in resource allocation problems. In particular, we study the level of concurrency that can be achieved in a wide class of resource allocation problem, i.e., the local resource allocation.
Document type :
Complete list of metadata

Cited literature [129 references]  Display  Hide  Download

Contributor : Abes Star :  Contact
Submitted on : Friday, January 12, 2018 - 4:30:07 PM
Last modification on : Friday, March 25, 2022 - 9:42:22 AM
Long-term archiving on: : Sunday, May 6, 2018 - 11:44:08 AM


Version validated by the jury (STAR)


  • HAL Id : tel-01592294, version 2



Anaïs Durand. Efficient distributed algorithms suited for uncertain context. Other [cs.OH]. Université Grenoble Alpes, 2017. English. ⟨NNT : 2017GREAM037⟩. ⟨tel-01592294v2⟩



Record views


Files downloads