Brief Announcement Logarithmic Expected-Time Leader Election in Population Protocol Model.

Brief Announcement Logarithmic Expected-Time Leader Election in Population Protocol Model.
复制标题

简短公告群体协议模型中的对数预期时间领导者选举。

DOI：
10.1145/3293611.3331585
复制
发表时间：
2019
期刊：
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019.
影响因子：
--
通讯作者：
Yuichi Sudo,Fukuhito Ooshita,Taisuke Izumi,Hirotsugu Kakugawa,Toshimitsu Masuzawa
Yuichi Sudo,Fukuhito Ooshita,Taisuke Izumi,Hirotsugu Kakugawa,Toshimitsu Masuzawa
中科院分区：
--
文献类型：
--
作者：
Ryota Eguchi;Naoki Kitamura;Taisuke Izumi;Taisuke Izumi,Francois Le Gall,Frederic Magniez;Yuval Emek,Noga Harlev,Taisuke Izumi;Yuichi Sudo,Fukuhito Ooshita,Taisuke Izumi,Hirotsugu Kakugawa,Toshimitsu Masuzawa

文献摘要

相似文献

在种群协议模型中，我们提出了一个期望在O(Logn)个并行时间内稳定且每个代理的状态为O(Logn)的领导者选举协议，其中n为代理的数量。给定种群大小n的粗略知识m，使得m≥=log2n且m=O(Logn)，该协议保证恰好选出一个领导者，并且唯一的领导者被永远保留。
In this paper, we present a leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of the population size n such that m ≥ = log2n and m=O(log n), this protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.