Filters








7,626 Hits in 5.9 sec

A survey of size counting in population protocols [article]

David Doty, Mahsa Eftekhari
2021 arXiv   pre-print
The population protocol model describes a network of n anonymous agents who cannot control with whom they interact.  ...  of population size n.  ...  Then for any k < n, in the self-stabilizing setting, any sub-population of k of these agents is a valid starting configuration for population size k.  ... 
arXiv:2105.05408v1 fatcat:awoz4rnthzhybixpg6qn2psvly

Stabilizing Tiny Interaction Protocols [article]

Davide Canepa, Maria Gradinariu Potop-Butucaru
2010 arXiv   pre-print
In this paper we present the self-stabilizing implementation of a class of token based algorithms. In the current work we only consider interactions between weak nodes.  ...  Our work shows that the agent paradigm is an elegant distributed tool for achieving self-stabilization in Tiny Interaction Protocols (TIP).  ...  Conclusions and discussions In this paper we focused on the self-stabilizing token circulation and (local) leader election solutions in population protocol model augmented with agents and the eventual  ... 
arXiv:0806.3471v2 fatcat:odfdkntoifb5dmcfol4t2rucre

Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols [chapter]

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa
2014 Lecture Notes in Computer Science  
In the population protocol model Angluin et al. proposed in 2004, there exists no self-stabilizing protocol that solves leader election on complete graphs without knowing the exact number of nodes.  ...  Our previous work presented a loosely-stabilizing protocol that solves the leader election on complete graphs using only the upper bound N of n, not the exact value of n.  ...  Self-stabilizing leader election is important in the PP model because (i) many population protocols in the literature work on the assumption that a unique leader exists [1] [2] [3] , and (ii) self-stabilization  ... 
doi:10.1007/978-3-319-14472-6_23 fatcat:v7xiyukbzzhdzar5i534n2y7lq

Constructing self-stabilizing oscillators in population protocols

Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
2017 Information and Computation  
For deterministic PPs, we show that the self-stabilizing leader election (SS-LE) and the self-stabilizing oscillator problem (SS-OSC) are equivalent, in the sense that an SS-OSC protocol is constructible  ...  Population protocols (PPs) are a model of passive distributed systems in which a collection of finite-state mobile agents interact with each other to accomplish a common task.  ...  of space complexity.  ... 
doi:10.1016/j.ic.2016.12.002 fatcat:76eog6hktnhnxhpzct2k5zcmam

Constructing Self-stabilizing Oscillators in Population Protocols [chapter]

Colin Cooper, Anissa Lamani, Giovanni Viglietta, Masafumi Yamashita, Yukiko Yamauchi
2015 Lecture Notes in Computer Science  
For deterministic PPs, we show that the self-stabilizing leader election (SS-LE) and the self-stabilizing oscillator problem (SS-OSC) are equivalent, in the sense that an SS-OSC protocol is constructible  ...  Population protocols (PPs) are a model of passive distributed systems in which a collection of finite-state mobile agents interact with each other to accomplish a common task.  ...  of space complexity.  ... 
doi:10.1007/978-3-319-21741-3_13 fatcat:gjda7gym7rfj5kr4hnugvgndmm

Loosely-stabilizing leader election with polylogarithmic convergence time

Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, Lawrence L. Larmore
2019 Theoretical Computer Science  
In the population protocol model, which is a common abstract model of mobile sensor networks, it is known to be impossible to design a self-stabilizing leader election protocol.  ...  A loosely-stabilizing leader election protocol with polylogarithmic convergence time in the population protocol model is presented in this paper.  ...  We can say that this is small space when we consider that any self-stabilizing leader election protocol, which requires knowledge of n, needs the space of at least log n bits [7] .  ... 
doi:10.1016/j.tcs.2019.09.034 fatcat:jtqmzuhoyfgljn5nv2omwxadwu

Time-optimal Loosely-stabilizing Leader Election in Population Protocols [article]

Yuichi Sudo, Ryota Eguchi, Taisuke Izumi, Toshimitsu Masuzawa
2020 arXiv   pre-print
We consider the leader election problem in population protocol models.  ...  In pragmatic settings of population protocols, self-stabilization is a highly desired feature owing to its fault resilience and the benefit of initialization freedom.  ...  For the remainder of this section, we presume parallel time when we discuss time complexity. In this paper, we focus on the problem of self-stabilizing leader election (SS-LE).  ... 
arXiv:2005.09944v1 fatcat:tz4wj5mjznczrlejglu5n554me

Space-Optimal Naming in Population Protocols

Janna Burman, Joffroy Beauquier, Devan Sohier, Michael Wagner
2019 International Symposium on Distributed Computing  
Fault-tolerance is addressed through self-stabilization, in terms of arbitrary initialization of agents.  ...  The considered distributed communication model is population protocols.  ...  This protocol is adapted here further for solving the naming problem in a self-stabilizing way -Prop. 16, while the protocol of Prop. 17 is based on the original Count P .  ... 
doi:10.4230/lipics.disc.2019.9 dblp:conf/wdag/BurmanBS19 fatcat:533lgse4pvbfra4gpeienlybte

Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols

Daisuke YOKOTA, Yuichi SUDO, Toshimitsu MASUZAWA
2021 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
We propose a self-stabilizing leader election protocol on directed rings in the model of population protocols.  ...  Given an upper bound N on the population size n, the proposed protocol elects a unique leader within O(nN ) expected steps starting from any configuration and uses O(N ) states.  ...  Many of the above studies on self-stabilizing population protocols have focused on self-stabilizing leader election (SS-LE) because leader election is one of the most fundamental problems in the PP model  ... 
doi:10.1587/transfun.2020eap1125 fatcat:qqxpjoum45gyhlkz45uhfcgg2u

Fast Approximate Counting and Leader Election in Populations [article]

Othon Michail, Paul G. Spirakis, Michail Theofilatos
2018 arXiv   pre-print
This protocol assumes the existence of a unique leader in the population and stabilizes in Θ(n) parallel time, using constant number of states in every node, except the unique leader which is required  ...  We study the problems of leader election and population size counting for population protocols: networks of finite-state anonymous agents that interact randomly under a uniform random scheduler.  ...  Acknowledgments We would like to thank David Doty and Mahsa Eftekhari for their valuable comments and suggestions during the development of this research work.  ... 
arXiv:1806.02638v1 fatcat:mxzpelv6ineodlvfmhdwgma2zy

Fast Space Optimal Leader Election in Population Protocols [chapter]

Leszek Gąsieniec, Grzegorz Stachowiak
2018 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms  
In this paper the emphasis is on the space complexity in fast leader election via population protocols governed by the random scheduler, which uniformly at random selects pairwise interactions within the  ...  The main result of this paper is a new fast and space optimal leader election protocol.  ...  Conclusion We studied in this paper fast and space efficient leader election in population protocols.  ... 
doi:10.1137/1.9781611975031.169 dblp:conf/soda/GasieniecS18 fatcat:flwd6kehprc5bjmv7m5lbqlbci

Polylogarithmic-Time Leader Election in Population Protocols Using Polylogarithmic States [article]

Dan Alistarh, Rati Gelashvili
2017 arXiv   pre-print
Yet, the fastest currently known population protocol for electing a leader only has linear stabilization time, and, it has recently been shown that no population protocol using a constant number of states  ...  In this paper, we give the first population protocol for leader election with polylogarithmic stabilization time, using polylogarithmic memory states per node.  ...  Reference [AAD + 06] gives a simple protocol for electing a leader from a uniform population, based on the natural idea of having leaders eliminate each other directly through symmetry breaking.  ... 
arXiv:1502.05745v3 fatcat:ik4b46m2kvbmjipwewvhs5qyfi

Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols [article]

Daisuke Yokota, Yuichi Sudo, Toshimitsu Masuzawa
2020 arXiv   pre-print
We propose a self-stabilizing leader election protocol on directed rings in the model of population protocols.  ...  Given an upper bound N on the population size n, the proposed protocol elects a unique leader within O(nN) expected steps starting from any configuration and uses O(N) states.  ...  Conclusion We have presented a self-stabilizing leader election protocol for rings in the population protocol.  ... 
arXiv:2009.10926v1 fatcat:yqtpdljpbfdjjnijbflcf52cf4

Time-optimal self-stabilizing leader election in population protocols [article]

Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty, Thomas Nowak, Eric Severson, Chuan Xu
2021 arXiv   pre-print
The self-stabilizing leader election problem requires the protocol to converge on a single leader agent from any possible initial configuration.  ...  We initiate the study of time complexity of population protocols solving this problem in its original setting: with probability 1, in a complete communication graph.  ...  Table 1 : Overview of time and space (number of states) complexities of self-stabilizing leader election protocols (which all also solve ranking).  ... 
arXiv:1907.06068v5 fatcat:uttnh2gwnbgqnolwcjciha3ona

Smoothed Analysis of Population Protocols [article]

Gregory Schwartzman, Yuichi Sudo
2021 arXiv   pre-print
We focus on the fundamental problem of leader election in population protocols.  ...  In this work, we initiate the study of smoothed analysis of population protocols.  ...  Unfortunately, the self-stabilizing leader election cannot be solved in the standard model [4] .  ... 
arXiv:2105.12262v1 fatcat:okpbqzlkhjd3lkf346abp677b4
« Previous Showing results 1 — 15 out of 7,626 results