Journal of Xidian University

Previous Articles     Next Articles

Probe selection algorithm for faulty links localization in all-optical networks

QI Xiaogang1;WANG Xiaolin1;LIU Lifang2   

  1. (1. School of Mathematics and Statistics, Xidian Univ., Xi'an 710071, China;
    2. School of Computer Science and Technology, Xidian Univ., Xi'an 710071, China)
  • Received:2017-04-27 Online:2018-04-20 Published:2018-06-06

Abstract:

This paper studies the probe selection problem in all-optical networks for achieving unambiguous faulty links localization. The existing random walk algorithm can find feasible solutions for localizing the faulty link unambiguously, but it consumes a large number of probes and wavelengths in large-size networks. First, monitoring paths are set up for failure detection. Second, the probing signals are sent out through all monitoring paths, and then the failure localization is performed on every faulty path. The proposed scheme proves that the problem of the minimal monitoring path set is NP-complete and can be solved by the heuristic monitoring path selection algorithm. It is also proved that a network must be k+1 edge connectivity for localizing k faulty links with one monitoring node. Compared with random walk, the probe selection algorithm greatly shortens the number of probes and consumed wavelengths per link.

Key words: failure detection, failure localization, monitoring path, probe, faulty links