A Totally Distributed Fair Scheduler for Population Protocols by Randomized Handshakes
A population protocol is a computational model based on pairwise interactions and designed for networks of passively mobile finite state agents. In the population protocol model, and also in the models that extend it, the interacting pairs are supposed to be chosen by a theoretical fair scheduler. In this paper, we present the HS Scheduler which is a totally distributed synchronous randomized handshake procedure. We then prove that this randomized handshake procedure can be a probabilistic consistent scheduler for population protocols that is fair with probability 1. By adopting a protocol aware version of the HS Scheduler, we introduce the iterated population protocols model where nodes can stop participating in the protocol’s computation once they reach a final state. We then study the time complexity of the computation of a particular case of this model where a final state is reached in only one computation step. We present some upper bounds that are later validated by simulations results.
KeywordsPopulation protocol Distributed randomized handshake Probabilistic fair scheduler Iterated population protocol
- 1.Abdou, W., Ouled Abdallah, N., Mosbah, M.: ViSiDiA: a Java framework for designing, simulating, and visualizing distributed algorithms. In: IEEE/ACM 18th International Symposium on Distributed Simulation and Real Time Applications (DS-RT), pp. 43–46 (2014)Google Scholar
- 2.Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 82–93. ACM (1980)Google Scholar
- 5.Becchetti, L., Bergamini, L., Ficarola, F., Salvatore, F., Vitaletti, A.: First experiences with the implementation and evaluation of population protocols on physical devices. IEEE Int. Conf. Green Comput. Commun. (GreenCom) 2012, 335–342 (2012)Google Scholar
- 7.Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating logarithmic space machines. In: CoRR (2010). abs/1004.3395
- 8.Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated population protocols. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part II (2009)Google Scholar