Probabilistic Analysis of Counting Protocols in Large-scale Asynchronous and Anonymous Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Probabilistic Analysis of Counting Protocols in Large-scale Asynchronous and Anonymous Systems

Abstract

We consider a large system populated by n anonymous nodes that communicate through asynchronous and pair-wise interactions. The aim of these interactions is for each node to converge toward a global property of the system, that depends on the initial state of each node. In this paper we focus on both the counting and proportion problems. We show that for any δ ∈ (0, 1), the number of interactions per node is O(ln(n/δ)) with probability at least 1 − δ. We also prove that each node can determine, with any high probability, the proportion of nodes that initially started in a given state without knowing the number of nodes in the system. This work provides a precise analysis of the convergence bounds, and shows that using the 4-norm is very effective to derive useful bounds.
Fichier principal
Vignette du fichier
NCA2017RI.pdf (131.39 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01580275 , version 1 (01-09-2017)
hal-01580275 , version 2 (09-10-2017)
hal-01580275 , version 3 (11-10-2017)

Identifiers

Cite

Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume. Probabilistic Analysis of Counting Protocols in Large-scale Asynchronous and Anonymous Systems. 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA), Oct 2017, Cambridge, United States. ⟨10.1109/nca.2017.8171371⟩. ⟨hal-01580275v3⟩
536 View
222 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More