Maximum metric spanning tree made Byzantine tolerant
Maximum metric spanning tree made Byzantine tolerant
复制标题
最大度量生成树使拜占庭容忍
DOI：
10.1007/s00453-014-9913-5
复制
发表时间：
2015
期刊：
影响因子：
1.1
通讯作者：
Sebastien Tixeuil
中科院分区：
文献类型：
--
作者：
Swan Dubois;Toshimitsu Masuzawa;Sebastien Tixeuil
自稳定是一种通用的容错方法，因为它允许分布式系统从任意破坏系统中所有存储器内容的任何瞬时故障中恢复。拜占庭容忍是分布式系统的一个吸引人的特性，它允许应对任意的恶意行为。本文研究的是同时具有自稳定和拜占庭容错的系统。将这两个性质结合起来会导致许多不可能的结果。因此，存在几种容错方案来抑制自稳定中的拜占庭故障。在这篇文章中，我们考虑了在这种情况下构造最大度量树的众所周知的问题。我们提供了一种新的分布式协议，该协议确保了关于拓扑感知严格和强稳定的最佳可能的遏制。
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. This paper focuses on systems that are both self-stabilizing and Byzantine tolerant. Combining these two properties is known to induce many impossibility results. Hence, there exist several fault tolerance schemes to contain Byzantine faults in self-stabilization. In this paper, we consider the well known problem of constructing a maximum metric tree in this context. We provide a new distributed protocol that ensures the best possible containment with respect to topology-aware strict and strong stabilization.