基于二进制树的光网络故障定位算法研究

Failure location algorithm for optical networks based on the binary tree

针对可能发生的各种故障,网络故障管理已经成为目前的热点问题。由于具有易损性、并且故障容易传播和难以检测的性质,当前几乎没有什么方法可以定位透明光网络的故障。因为它的故障传输并不是孤立的,通常比不透明网络更容易出现故障。为了能够尽可能精确的预防和定位故障,采用一种有效的故障定位方法。根据定位这种网络故障现存的方法——监控每个光信号再生点的情况,参考二进制故障树算法,对设置了监控器的透明光网络进行故障定位。该算法既考虑了理想情况(不存在漏/误告警)也考虑了存在漏/误告警的非理想情况,从而提高了故障定位的准确性。

Failure management of networks has become a very important issue because any failure may occur, Transparent networks are vulnerable ,easy propagation and difficult detection of failures. However, no method exists today that performs failure location for transparent optical networks. Such networks are more vulnerable to failures than opaque networks since failures propagate without being isolated. In order to prevent and localize fail- ure as accurately as possible, an efficient failure location method is needed. To locate failure in opaque optical net- works, existing methods which allow monitoring of the optical signal at every regeneration site can be used. With reference to the binary tree algorithm, carried on the fault location at the base of transparent light network with monitors. The failure location algorithm developed in this paper can cope with ideal scenarios （no false and/or lost alarms）, as well as with non ideal scenarios having false and/or lost alarms. It thus enhances the accuracy of failure location.