...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE systems journal >Distributed Elections Using Site-Push Majority Winner Monitoring
【24h】

Distributed Elections Using Site-Push Majority Winner Monitoring

机译：分布式选举使用现场 - 推动大多数获胜者监测

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The problem of distributed election majority-winner monitoring for checkpoint-based protocols has been of interest for some time now, and the approach that most of the major algorithms take on this is to employ a center-based pull from all voting sites in conjunction with a count tracker, to continually monitor the information about the incoming voter stream. This paper presents an alternative solution to this problem, using site-based voter information push to the center, with reduced communication complexity, using a unique sampling technique. This technique is utilized to come up with a winner or an approximate winner with very high probability for Approval-based and Scoring-based rules. The site-push algorithm introduced here has been validated with correctness results, and has also been analyzed for different scenarios to see the improvement in the number of messages initiated, in comparison to the center-based pull algorithm considered for a checkpoint-based protocol. The effect of this algorithm is to reduce the communication complexity by a factor of (1 + log k/log n/k) in comparison to the center-pull algorithm (where k is the number of voting sites, and n the number of voters), which leads to a large reduction in communication complexity in democratic election scenarios. Also, to analyze other scenarios, simulation results are presented to show how the algorithm fares under randomized voter assignment, with variations in the value of total voters, total sites and the approximation parameter epsilon.
机译：分布式选举多数赢家监测的检查点的议定书的问题已经感兴趣，并且大多数主要算法对此的方法是雇用从所有投票网站的中心的拉力计数跟踪器，以不断监视传入选民流的信息。本文介绍了此问题的替代解决方案，使用基于站点的选民信息推送到中心，使用独特的采样技术，通过降低的通信复杂性。这种技术用于赢得胜利者或近似获奖者，具有非常高的基于批准和基于评分的规则的概率。此处介绍的站点推送算法已被验证为正确的结果，并且还针对与基于检查点的协议考虑的基于中心的拉动算法相比，查看了不同的场景，以便看到发起的消息数量的改进。该算法的效果是与中心拉算法相比（1 + log k / log n / k）的通信复杂度（其中k是投票站点的数量，并且是选民的数量），导致民主选举情景中的通信复杂性大幅减少。此外，为了分析其他场景，提出了仿真结果，以展示如何在随机选民分配下的算法票价，具有总选民的值，总站点和近似参数epsilon的变化。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号