• Aucun résultat trouvé

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics

N/A
N/A
Protected

Academic year: 2021

Partager "On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics"

Copied!
33
0
0

Texte intégral

Figure

Figure 1: Stabilizing leader election: summary of the results. Pseudo- (and so self-) stabilizing leader election is impossible in the red area
Table 3: Classes where every vertex is a sink and a source – indexed by ∗, ∗ with G a dynamic graph with vertex set V and ∆ ∈ N ∗ .

Références

Documents relatifs

One of the interesting techniques for leader election is used in the WBS (Wait Before Starting) algorithm, in which each node in the network will wait for a time corresponding to

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

− convergence – when b-Tiara and s-Tiara are stable, no links are added to b-Tiara, outermost link enables trim which removes it. mardi 19

Fold-change of discriminant metabolites identified by 1 H NMR metabolomics approach in aqueous liver extracts of Carassius auratus exposed to pesticide mixture (PEST),

Results In CKD rats, we found cognitive impairment in the novel object recognition test, the object loca- tion task, and social memory tests and an increase of blood-brain

The goal of the paper is to provide designers of distributed self- stabilizing protocols with a fair and reliable communication primitive which allows any process which writes a

The first stage is a uniform randomized stabilizing unique naming protocol, and the second stage is a stabilizing MDST protocol, designed as a fair composition of

Besides, the method is tailor-made for finding only the average number of rounds required by the algorithm: the second moment (and a fortiori all other moments), and the