首页> 外文会议>International symposium on stabilization, safety, and security of distributed systems >Logarithmic Expected-Time Leader Election in Population Protocol Model
【24h】

Logarithmic Expected-Time Leader Election in Population Protocol Model

机译:人口协议模型中的对数期望时间领导者选举

获取原文

摘要

In this paper, we present the first 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 ≥ log_2 n and m = O(log n), the proposed protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter.
机译:在本文中,我们提出了人口协议模型中的第一个领导者选举协议,该协议稳定在O(log n)并行时间内,期望每个代理具有O(log n)状态,其中n是代理的数量。给定人口数量n的大致知识m,使得m≥log_2 n且m = O(log n),建议的协议可确保只选举一位领导人,此后永远保留唯一的领导人。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号