Modeling fault-tolerant mobile agent execution as a sequence of agreement problems
Modeling fault-tolerant mobile agent execution as a sequence of agreement problems
复制标题
DOI：
10.1109/reldi.2000.885388
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Stefan Pleisch;A. Schiper
中科院分区：
文献类型：
--
作者：
Stefan Pleisch;A. Schiper
容错是移动代理应用进一步发展的基础。在移动代理的环境中，容错可以防止代理的部分或全部丢失，即确保代理到达其目的地。像检查点这样的简单方法很容易被阻塞。原则上，复制可以改进基于检查点的解决方案。然而，在这种情况下的现有解决方案要么假设完美的故障检测机制(这在诸如因特网的环境中是不现实的)，要么依赖于基于领导者选举和分布式事务的复杂解决方案，其中只有解决方案的子集防止阻塞。提出了一种新的容错移动代理执行方法，该方法将移动代理的执行建模为一系列的协议问题。每个共识问题都是众所周知的共识问题的一个例子。我们的解决方案不需要完美的故障检测机制，同时防止阻塞并确保代理只执行一次。
Fault tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault tolerance prevents a partial or complete loss of the agent, i.e. ensures that the agent arrives at its destination. Simple approaches such as checkpointing are prone to blocking. Replication can in principle improve solutions based on checkpointing. However existing solutions in this context either assume a perfect failure detection mechanism (which is not realistic in an environment such as the Internet), or rely on complex solutions based on leader election and distributed transactions, where only a subset of solutions prevents blocking. The paper proposes a novel approach to fault tolerant mobile agent execution, which is based on modeling agent execution as a sequence of agreement problems. Each agreement problem is one instance of the well understood consensus problem. Our solution does not require a perfect failure detection mechanism, while preventing blocking and ensuring that the agent is executed exactly once.