• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Future Information Engineering >Improvement of the Byzantine Agreement Problem under Mobile P2P Network
【24h】

Improvement of the Byzantine Agreement Problem under Mobile P2P Network

机译：移动P2P网络下拜占庭协议问题的改进

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

For improving the accuracy under P2P networks, it must be assured that all non-faulty peers can reach agreement. As such, all the non-faulty peers need to work collaboratively despite disturbances caused by faulty peers. This agreement issue is usually called as the Byzantine Agreement (BA) problem. In previous works, [(n-1)/3] + 1 bouts for exchanging message are necessary to allow all non-faulty peers reaching an agreement. Furthermore, the message complexity of these algorithms are O(n~n). Hence, the relevant algorithms are not suitable for mobile P2P networks in which there may have a great quantity of mobile peers. In this study, a more efficient algorithm has been proposed to decrease the required bouts for exchanging message. Our proposed algorithm only need to run three bouts for exchanging message to allow all non-faulty peers to reach an agreement despite some peers roaming among the different network. It also can decrease the message complexity to O(n~2). It is more suitable and efficient than previous efforts aimed at the mobile P2P network.
机译：为了提高P2P网络下的准确性，必须放心，所有非故障同行都可以达到协议。因此，尽管对同行故障引起的干扰，但所有非故障的同行都需要协同工作。该协议问题通常被称为拜占庭协议（BA）问题。在以前的作品中，需要进行交换消息的[（n-1）/ 3] + 1次呼号，以允许所有非故障对等体达成协议。此外，这些算法的消息复杂性是O（n〜n）。因此，相关算法不适用于移动P2P网络，其中可能具有大量的移动对等体。在这项研究中，已经提出了一种更有效的算法来减少用于交换消息所需的竞争。我们所提出的算法只需要运行三个竞争，以便交换消息，以允许所有非故障的同行达到协议，尽管有些同行在不同的网络中漫游。它还可以将消息复杂性降低到O（n〜2）。它比以前的努力更适合和效率效率更适合于移动P2P网络。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号