首页 | 本学科首页   官方微博 | 高级检索  
     


A simple population protocol for fast robust approximate majority
Authors:Dana Angluin  James Aspnes  David Eisenstat
Affiliation:(1) Department of Computer Science, Yale University, New Haven, CT, USA;(2) New Haven, CT, USA
Abstract:We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given an initial configuration of x’s, y’s and blanks that contains at least one non-blank, the goal is for the agents to reach consensus on one of the values x or y. Additionally, the value chosen should be the majority non-blank initial value, provided it exceeds the minority by a sufficient margin. We prove that with high probability n agents reach consensus in O(n log n) interactions and the value chosen is the majority provided that its initial margin is at least $${omega(sqrt{n} ,{rm log}, n)}$$. This protocol has the additional property of tolerating Byzantine behavior in $${o(sqrt{n})}$$ of the agents, making it the first known population protocol that tolerates Byzantine agents.
Keywords:Population protocols  Majority  Epidemics  Byzantine faults
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号