Abstract
We previously showed the feasibility of a fault detection scheme for all-optical networks (AONs) based on their decomposition into monitoring-cycles (m-cycles). In this paper, an m-cycle construction for fault detection is formulated as a cycle cover problem with certain constraints. A heuristic spanning-tree based cycle construction algorithm is proposed and applied to four typical networks: NSFNET, ARPA2, SmallNet, and Bellcore. Three metrics: grade of fault localization, wavelength overhead, and the number of cycles in a cover are introduced to evaluate the performance of the algorithm. The results show that it achieves nearly optimal performance.
Similar content being viewed by others
References
S. Ramamurthy L. Sahasrabuddhe B. Mukherjee (2003) ArticleTitleSurvivable WDM mesh networks IEEE/OSA J. Lightwave Technol. 21 IssueID4 870–883
Goyal, M., Ramakrishnan, K.K., Feng, W.-C.: Achieving faster failure detection in OSPF networks. Proc. of IEEE ICC’03, Anchorage, Alaska, SA, May 2003, vol. 1, pp. 296–300
C. Mas P. Thiran (2001) ArticleTitleA review on fault location methods and their applications in optical networks Optical Network Magazine 2 IssueID4 73–87
Kobayashi, Y., Tada, Y., Matsuoka, S., Hirayama, N., Hagimoto, K.:Supervisory systems for all-optical network transmission systems.Proc. of IEEE Globecom’96, London, UK, November 1996, vol. 2, pp. 933–937
Mèdard, M., Marquis, D., Chinn, S.R.: Attack detection methods for all-optical networks. Proc. of Network and Distributed System Security Symposium, San Diego, California, March 1998, session 3
Hamazumi, Y., Koga, M., Kawai, K., Ichino, H., Sato, K.: Optical path fault management in layered networks. Proc. of IEEE Globecom’98, Sydney, Australia, November 1998, vol. 4, pp. 2309-2314
C.-S. Li R. Ramaswami (1997) ArticleTitleAutomatic fault detection, isolation, and recovery in transparent all-optical networks IEEE/OSA J Lightwave Technol. 15 IssueID10 1784–1793
Stanic, S., Subramaniam, S., Choi, H., Sahin, G., Choi, H.-A.: On monitoring transparent optical networks. Proc. of International Conference on Parallel Processing Workshops, Vancouver, British Columbia, Canada, August 2002, pp. 217–223
Wu, T., Somani, A.K.: Attack monitoring and localization in all-optical networks. Proc. of SPIE Opticommun 2002: Optical Networking and Communications, Boston, MA, USA, July 2002, vol. 4874, pp. 235–248
Wu, T., Somani, A.K.: Necessary and sufficient condition for k crosstalk attacks localization in all-optical networks. Proc. of IEEE Globecom’03, San Francisco, CA, USA, Dececember 2003, vol. 5, pp. 2541–2546
Zeng, H., Huang, C., Vukovic, A., Savoie, M.: Fault detection and path performance monitoring in meshed all-optical networks,” Proc. of IEEE Globecom’04, Dallas, TX, USA, November 2004, vol. 3, pp. 2014–2018
A. Itai M. Rodeh (1978) Covering a graph by circuits, Automata, languages and programming Springer-Verlag Berlin 289–299
G. Fan (1992) ArticleTitleCovering graphs by cycles SIAM J Discrete Mathe. 5 IssueID4 491–496 Occurrence Handle0777.05087
H. Walther (1984) Ten applications of graph theory, Chapter 1: Flows and tensions on networks D. Reidel Pub. Co. Boston
R.J. Wilson J.J. Watkins (1990) Graphs: an introductory approach, Chapter 10: Trees Wiley New York
S.V. Kartalopoulos (2001) Fault detectability in DWDM – toward higher signal quality & system reliability IEEE Press Piscataway
W.D. Grover (2004) Mesh-based survivable networks: options and strategies for optical, MPLS, SONET, and ATM Networking Prentice Hall PTR Upper Saddle River, NJ
Elliott, R.: Dark fibre pricing analysis Europe 1998–2002, [Online document], November 2002, available at http://www.band-x.com/information/Dark_Fibre_Report-prices_98–02webversion.pdf
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zeng, H., Huang, C. & Vukovic, A. A Novel Fault Detection and Localization Scheme for Mesh All-optical Networks Based on Monitoring-cycles. Photon Netw Commun 11, 277–286 (2006). https://doi.org/10.1007/s11107-005-7355-3
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11107-005-7355-3