Skip to Main content Skip to Navigation

Space-Optimal Naming in Population Protocols

Abstract : The distributed naming problem, assigning different names to the nodes in a distributed system, is a fundamental task. This problem is non trivial, specially when the amount of memory available for the task is low, and when requirements for fault-tolerance are added. The considered distributed computation model is population protocols. In this model, a priori anonymous and indistinguishable mobile nodes (called agents), communicate in pairs and in an asynchronous manner (according to a fairness condition). Fault-tolerance is addressed through self-stabilization, in terms of arbitrary initialization of agents. This work comprises a comprehensive study on the necessary and sufficient state space conditions for naming. It is studied under various combinations of model assumptions: weak or global fairness, arbitrary or uniform initialization of agents, existence or absence of a distinguishable agent (arbitrarily initialized or not), possibility of breaking symmetry in pair-wise interactions (symmetric or asymmetric transitions). For each possible combination of these assumptions, either an impossibility is proven or the necessary exact number of states (per mobile agent) is determined and an appropriate space-optimal naming protocol is presented.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Janna Burman <>
Submitted on : Sunday, August 4, 2019 - 11:37:28 PM
Last modification on : Saturday, May 1, 2021 - 3:50:26 AM


Files produced by the author(s)



Janna Burman, Joffroy Beauquier, Devan Sohier. Space-Optimal Naming in Population Protocols. [Research Report] LRI, Université Paris Sud, CNRS, Université Paris-Saclay, France. 2018. ⟨hal-01790517v3⟩



Record views


Files downloads