Solving the consensus problem in a mobile environment
Solving the consensus problem in a mobile environment
复制标题
DOI：
10.1109/pccc.1999.749417
复制
发表时间：
1999-02
期刊：
影响因子：
--
通讯作者：
N. Badache;Michel Hurfin;R. Macêdo
中科院分区：
文献类型：
--
作者：
N. Badache;Michel Hurfin;R. Macêdo
原子广播或非阻塞原子提交是设计容错分布式系统时遇到的经典协议问题。解决这类协议问题的具体协议可以基于一个共同的构建块来设计，即共识服务。不幸的是，在一个甚至只有一个进程崩溃故障的异步分布式系统中，共识问题没有确定性的解决方案。在为避免这一不可能结果而提出的解决方案中，Chandra和Touig提出的不可靠故障检测器的概念尤其吸引人。他们定义了一个协议，当底层故障检测器属于类/SPL Square/S的假设成立时，该协议解决了共识问题。本文提出了他们的协议的一个扩展，允许在移动环境中解决这一基本问题。在这样的环境中，问题更具挑战性：一组移动主机必须根据它们的初始状态，在连接断开、位置改变和移动/固定主机故障的情况下，就共同的决策达成一致。
Atomic broadcast or non-blocking atomic commitment are classic agreement problems encountered when designing fault-tolerant distributed systems. Specific protocols that solve such agreement problems can be designed based on a common building block, namely the consensus service. Unfortunately, the consensus problem has no deterministic solution in an asynchronous distributed system that is subject to even a single process crash failure. Among the solutions proposed to circumvent this impossibility result, the concept of unreliable failure detectors proposed by Chandra and Toueg is particularly attractive. They have defined a protocol that solves the consensus problem when the assumption that the underlying failure detector belongs to the class /spl square/S holds true. This paper presents an extension of their protocol that allows to solve this fundamental problem in a mobile environment. In such an environment, the problem is more challenging: based on their initial states, a set of mobile hosts must agree on a common decision, despite disconnections, changes of location and failures of mobile/fixed hosts.