Probabilistic analysis of counting protocols in large-scale asynchronous and anonymous systems

• Published in: 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA) pp. 1 - 8
• Main Authors: Mocquard, Yves, Sericola, Bruno, Anceaume, Emmanuelle
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-10-2017
• Subjects: Analytical models; Computational modeling; Convergence; Counting problem; Large scale anonymous and asynchronous system; Markov chain; Markov processes; Probabilistic analysis; Proportion problem; Protocols; Sociology; Statistics
• DOI: 10.1109/NCA.2017.8171371

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 needed per node to converge 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.