NP-Complete Problem in Multiple Fault Localization in Pbit/s Optical Networks

NP-complete in multiple fault localization in Pbit/s optical networks has become more difficult to solve.Computational complexity and computing time grow exponentially with the size of the network.This paper introduces fault localization mechanisms,including transparent fault location algorithm,inference algorithm,run-length probing algorithm,heuristic spanning tree with m-cycle,and limited-perimeter vector matching(LVM)fault-localization protocol.Difficulties in NP-complete of multiple fault localization in a Pbit/s optical network are analyzed,and an ant colony optimization algorithm is proposed to determine the minimum number of failures.