A fast distributed network restoration algorithm

Abstract

The authors present a fast distributed network restoration algorithm for restoring disrupted traffic in a digital cross-connect system (DCS) based fiber network due to fiber span cut. The proposed algorithm is based on a two-prong approach where both disrupted ends simultaneously send out restore messages as opposed to the conventional approaches where one end is selected as the sender and only the sender sends out restore messages. It is shown that the proposed algorithm outperforms those distributed network restoration algorithms based on the sender-chooser approach, and are capable of rerouting the disrupted traffic in sub-seconds. The simulation results of the performance of the new algorithm and other known distributed network restoration algorithms are presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>