How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model

2011 ◽  
Vol 50 (3) ◽  
pp. 433-445 ◽  
Author(s):  
Shukai Cai ◽  
Taisuke Izumi ◽  
Koichi Wada
2012 ◽  
Vol 25 (6) ◽  
pp. 451-460 ◽  
Author(s):  
Ryu Mizoguchi ◽  
Hirotaka Ono ◽  
Shuji Kijima ◽  
Masafumi Yamashita

2020 ◽  
Vol 30 (01) ◽  
pp. 2050005 ◽  
Author(s):  
Yuichi Sudo ◽  
Toshimitsu Masuzawa

This paper shows that every leader election protocol requires logarithmic stabilization time both in expectation and with high probability in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and is allowed to use an arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., SSS 2019] is time-optimal in expectation.


Author(s):  
Yuichi Sudo ◽  
Fukuhito Ooshita ◽  
Taisuke Izumi ◽  
Hirotsugu Kakugawa ◽  
Toshimitsu Masuzawa

2012 ◽  
Vol 444 ◽  
pp. 100-112 ◽  
Author(s):  
Yuichi Sudo ◽  
Junya Nakamura ◽  
Yukiko Yamauchi ◽  
Fukuhito Ooshita ◽  
Hirotsugu Kakugawa ◽  
...  

Author(s):  
Yuichi Sudo ◽  
Junya Nakamura ◽  
Yukiko Yamauchi ◽  
Fukuhito Ooshita ◽  
Hirotsugu Kakugawa ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document