• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks
【24h】

Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks

机译：在未知动态网络中使用故障检测器解决k-Set协议

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

摘要

The failure detector abstraction has been used to solve agreement problems in asynchronous systems prone to crash failures, but so far it has mostly been used in static and complete networks. This paper aims to adapt existing failure detectors in order to solve agreement problems in unknown, dynamic systems. We are specifically interested in the k-set agreement problem. The problem of k-set agreement is a generalization of consensus where processes can decide up to k different values. Although some solutions to this problem have been proposed in dynamic networks, they rely on communication synchrony or make strong assumptions on the number of process failures. In this paper we consider unknown dynamic systems modeled using the formalism of Time-Varying Graphs, and extend the definition of the existing ΠΣx,y failure detector to obtain the ΠΣ⊥,x,y failure detector, which is sufficient to solve k-set agreement in our model. We then provide an implementation of this new failure detector using connectivity and message pattern assumptions. Finally, we present an algorithm using ΠΣ⊥,x,y to solve k-set agreement.
机译：故障检测器抽象已用于解决易于崩溃故障的异步系统中的协议问题，但到目前为止，它已主要用于静态和完整的网络中。本文旨在调整现有的故障检测器，以解决未知动态系统中的协议问题。我们对k-set协议问题特别感兴趣。 k集一致的问题是共识的泛化，其中过程可以决定最多k个不同的值。尽管在动态网络中已经提出了针对此问题的一些解决方案，但是它们依赖于通信同步或对过程失败的数量做出了强有力的假设。在本文中，我们考虑使用时变图形式化建模的未知动态系统，并扩展现有的ΠΣx，y故障检测器的定义以获得ΠΣ⊥，x，y故障检测器，足以解决k-set在我们的模型中达成一致。然后，我们使用连接性和消息模式假设来提供此新故障检测器的实现。最后，我们提出一种使用ΠΣ⊥，x，y的算法来解决k-set一致性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号