摘要： 为提高环网的容错性能,文献[1]提出了一种基于事件驱动的故障重构算法,其缺点是该算法只能容忍连线故障。本文给出一种新的采用时钟起时驱动的重构算法,该算法既能容忍连线故障也能容忍站(或节点)故障,且令牌控制较文献[1]的简单。

关键词: 计算机网络, 容错技术, 算法, 重构

Abstract: S To enhance fault-tolerant capability of ring networks, [1] presented an event-driven reconfiguration algorithm, in which only link faults are tolerated. In this paper, we propose a timer-based algorithm, with which faults of both links and stations (or nodes) are tolerated. In addition, the token control is simpler than that of [1].