OSA's Digital Library

Journal of Lightwave Technology

Journal of Lightwave Technology


  • Vol. 27, Iss. 10 — May. 15, 2009
  • pp: 1392–1401

Monitoring Cycle Design for Fast Link Failure Localization in All-Optical Networks

Bin Wu, Kwan L. Yeung, and Pin-Han Ho

Journal of Lightwave Technology, Vol. 27, Issue 10, pp. 1392-1401 (2009)

View Full Text Article

Acrobat PDF (716 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

  • Export Citation/Save Click for help


A monitoring cycle (m-cycle) is a preconfigured optical loop-back connection of supervisory wavelengths with a dedicated monitor. In an all-optical network (AON), if a link fails, the supervisory optical signals in a set of m-cycles covering this link will be disrupted. The link failure can be localized using the alarm code generated by the corresponding monitors. In this paper, we first formulate an optimal integer linear program (ILP) for m-cycle design. The objective is to minimize the monitoring cost which consists of the monitor cost and the bandwidth cost (i.e., supervisory wavelength-links). To reduce the ILP running time, a heuristic ILP is also formulated. To the best of our survey, this is the first effort in m-cycle design using ILP, and it leads to two contributions: 1) nonsimple m-cycles are considered; and 2) an efficient tradeoff is allowed between the monitor cost and the bandwidth cost. Numerical results show that our ILP-based approach outperforms the existing m-cycle design algorithms with a significant performance gain.

© 2009 IEEE

Bin Wu, Kwan L. Yeung, and Pin-Han Ho, "Monitoring Cycle Design for Fast Link Failure Localization in All-Optical Networks," J. Lightwave Technol. 27, 1392-1401 (2009)

Sort:  Year  |  Journal  |  Reset


  1. Y. G. Wen, V. W. S. Chan, L. Z. Zheng, "Efficient fault diagnosis algorithms for all-optical WDM networks with probabilistic link failures (invited paper)," J. Lightw. Technol. 23, 3358-3371 (2005).
  2. M. Goyal, K. K. Ramakrishnan, W.-C. Feng, "Achieving faster failure detection in OSPF networks," Proc. IEEE ICC '03 (2003) pp. 296-300.
  3. C. Assi, Y. Ye, A. Shami, S. Dixit, M. Ali, "A hybrid distributed fault-management protocol for combating single-fiber failures in mesh-based DWDM optical networks," Proc. IEEE GLOBECOM '02 (2002) pp. 2676-2680.
  4. H. Zeng, C. Huang, A. Vukovic, M. Savoie, "Fault detection and path performance monitoring in meshed all-optical networks," Proc. IEEE GLOBECOM '04 (2004) pp. 2014-2018.
  5. H. Zeng, C. Huang, A. Vukovic, "A novel fault detection and localization scheme for mesh all-optical networks based on monitoring-cycles," Photon. Netw. Commun. 11, 277-286 (2006).
  6. H. Zeng, A. Vukovic, "The variant cycle-cover problem in fault detection and localization for mesh all-optical networks," Photon. Netw. Commun. 14, 111-122 (2007).
  7. B. Wu, K. L. Yeung, "${\rm M}^{2}$-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks," Proc. IEEE GLOBECOM '06 (2006).
  8. Y. Hamazumi, M. Koga, K. Kawai, H. Ichino, K. Sato, "Optical path fault management in layered networks," Proc. IEEE GLOBECOM '98 (1998) pp. 2309-2314.
  9. C.-S. Li, R. Ramaswami, "Automatic fault detection, isolation, and recovery in transparent all-optical networks," J. Lightw. Technol. 15, 1784-1793 (1997).
  10. S. Stanic, S. Subramaniam, H. Choi, G. Sahin, H.-A. Choi, "On monitoring transparent optical networks," Proc. Int. Conf. Parallel Process. Workshops (2002) pp. 217-223.
  11. R. Diestel, Graph Theory (Spring-Verlag, 2000).
  12. C. G. Gruber, "Resilient networks with nonsimple $p$-cycles," Proc. IEEE ICT '03 (2003) pp. 1027-1032.
  13. D. A. Schupke, C. G. Gruber, A. Autenrieth, "Optimal configuration of $p$-cycles in WDM network," Proc. IEEE ICC '02 (2002) pp. 2761-2765.
  14. B. Wu, K. L. Yeung, S. Z. Xu, "ILP formulation for $p$-cycle construction based on flow conservation," Proc. IEEE GLOBECOM '07 (2007) pp. 2310-2314.
  15. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, 1993).

Cited By

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited