Efficient fault-diagnosis algorithms for all-optical WDM networks with probabilistic link failures

被引:70
作者
Wen, YG [1 ]
Chan, VWS [1 ]
Zheng, LZ [1 ]
机构
[1] MIT, Informat & Decis Syst Lab, Cambridge, MA 02139 USA
关键词
all-optical networks; fault diagnosis; fault management; network management; run-length code;
D O I
10.1109/JLT.2005.855695
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper investigates the fault-diagnosis problem for all-optical wavelength-division-multiplexing (WDM) networks. A family of failure-localization algorithms that exploit the unique properties of all-optical networks is proposed. Optical probe signals are sequentially sent along a set of designed light-paths, and the network state is inferred from the result of this set of end-to-end measurements. The design objective is to minimize the diagnosis effort (e.g., the average number of probes) to locate failures. By establishing a mathematical equivalence between the fault-diagnosis problem and the source-coding problem in information theory, we obtain a tight lower bound for the minimum average number of probes per edge (of the network modeled as a graph) as H-b(P), the entropy of the individual edges. Using the rich set of results from coding theory to solve the fault-diagnosis problem, it is shown that the "2(m)-splitting" probing scheme is optimum for the special case of single failure over a linear network. A class of near-optimum run-length probing schemes that have low computation complexity is then developed. Analytical and numerical results suggest that the average number of probes per edge for the run-length probing scheme is uniformly bounded above by (1 + epsilon) H-b (p) and converges to the entropy lower bound as the failure probability decreases. From an information-theoretic perspective, it is shown that the run-length probing scheme outperforms the greedy probing scheme of the same computational complexity. The investigation reveals a guideline for efficient fault-diagnosis schemes: Each probe should provide approximately 1 bit of information, and the total number of probes required is approximately equal to the entropy of the state of the network. This result provides an insightful guideline to reduce the overhead cost of fault management for all-optical networks and can further the understanding of the relationship between information entropy and network management. Several practical issues are also addressed in the implementation of run-length probing schemes over all-optical WDM networks.
引用
收藏
页码:3358 / 3371
页数:14
相关论文
共 26 条
  • [1] Ahlswede R., 1987, Search Problems
  • [2] THE CONSENSUS PROBLEM IN FAULT-TOLERANT COMPUTING
    BARBORAK, M
    MALEK, M
    DAHBURA, A
    [J]. COMPUTING SURVEYS, 1993, 25 (02) : 171 - 220
  • [3] Bollob┬u├s B., 2013, MODERN GRAPH THEORY, V184
  • [4] CHAN VW, 1995, SCI AM, V273, P72
  • [5] CHAN VWS, 1993, J LIGHTW TECHNOL, V11, P714
  • [6] Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
  • [7] OPTIMAL SOURCE CODES FOR GEOMETRICALLY DISTRIBUTED INTEGER ALPHABETS
    GALLAGER, RG
    VANVOORHIS, DC
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) : 228 - 230
  • [8] Ho T, 2003, IEEE INFOCOM SER, P1456
  • [9] Optical performance monitoring
    Kilper, DC
    Bach, R
    Blumenthal, DJ
    Einstein, D
    Landolsi, T
    Ostar, L
    Preiss, A
    Willner, AE
    [J]. JOURNAL OF LIGHTWAVE TECHNOLOGY, 2004, 22 (01) : 294 - 304
  • [10] PROBABILISTIC DIAGNOSIS OF MULTIPROCESSOR SYSTEMS
    LEE, SG
    SHIN, KG
    [J]. ACM COMPUTING SURVEYS, 1994, 26 (01) : 121 - 139