Skip to main content
SpringerLink
Log in

Multi-fault aware parallel localization protocol for backbone network with many constraints

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

To solve the issue of tracking down multi-link failures for backbone network fast and accurately, a multi-fault aware localization protocol based on knight’s tour theory is proposed in this paper. First of all, the network model is established according to knight’s tour theory. By using the method of network element abstracting with constraints, the network topology is mapped into the special chessboard with holes logically. Then, the probing messages are sent periodically along pre-computed knight’s tour paths, so that the available light-paths are collected dynamically at the destination. Finally, the failed links could be determined by iteratively matching the links. Through the established general performance analysis model, it is shown that the proposed protocol has lower time complexity than other related classical protocols. Further, the simulation experiment is used to demonstrate that the proposed protocol can achieve unambiguous parallel localization under multiple link failures scenario in the different network topologies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Zeng, H., Huang, C.: Fault detection and path performance monitoring in meshed all-optical networks. In: Proceedings of IEEE GLOBECOM’04, pp. 2014–2018 (2004)

  2. Zeng H., Huang C., Vukovic A.: A novel fault detection and localization scheme for mesh all-optical networks based on monitoring-cycles. Photonic Netw. Commun. 11, 277–286 (2006)

    Article  Google Scholar 

  3. Wu, B., Ho, P.-H., Yeung, K.L.: Monitoring trail: a new paradigm for fast link failure localization in WDM mesh networks. In: Proceedings of IEEE GLOBECOM’08, pp. 1–5 (2008)

  4. Babarczi P., Tapolcai J., Ho P.-H.: Adjacent link failure localization with monitoring trails in all-optical mesh networks. IEEE/ACM Trans. Netw. 19(3), 907–920 (2011)

    Article  Google Scholar 

  5. Wang R., Chang J., Long K. et al.: Fault detection mechanism for optical burst switching networks based on power monitoring. J. Chongqing Univ. Posts Telecommun. (Nat. Sci.) 19(1), 62–65 (2007)

    Google Scholar 

  6. Tapolcai, J., Ronyai, L., Ho, P.-H.: Optimal solutions for single fault localization in two dimension lattice networks. In: Proceedings of IEEE INFCOM, pp. 1–5 (2010)

  7. Liu, D., Wang, R.: A fast fault location algorithm based on pre-computed for optical burst switching network. International Conference on Communication Software and Networks, ICCSN’09, pp. 558–561 (2009)

  8. Wang, R., Xu, L., Wu, D.: An effective multi-fault localization algorithm for optical networks. In: Intelligent Information Technology Application Workshops, IITAW ’09, pp. 133–136 (2009)

  9. Zeng, H., Vukovic, A.: A novel end-to-end fault detection and localization protocol for wavelength-routed WDM networks. In: Proceedings of SPIE, pp. 1–8 (2005)

  10. Sichani A.V., Mouftah Hussein T.: Limited-perimeter vector matching fault-localization protocol for transparent all-optical communication networks. IET Commun. 1(3), 472–478 (2007)

    Article  Google Scholar 

  11. Khair, M., Jun, Z., Mouftah, H.T.: Distributed multi-failure localization protocol for all-optical networks. International Conference on Optical Network Design and Modeling, pp. 1–6 (2009)

  12. Lee H.-W., Modiano E., Lee K.: Diverse routing in networks with probabilistic failures. IEEE/ACM Trans. Netw. 18(6), 1895–1907 (2010)

    Article  Google Scholar 

  13. Dahan D., Mahlab U., Teixeira A. et al.: Optical performance monitoring for translucent/transparent optical networks. IET Optoelectron. 5(1), 1–18 (2011)

    Article  Google Scholar 

  14. Lin S.-S., Wei C.-L.: Optimal algorithms for constructing knight’s tours on arbitrary n × m chessboards. Discret. Appl. Math. 146(3), 219–232 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kyek O., Parberry I., Wegene T.: Bounds on the number of knight’s tours [J]. Discret. Appl. Math. 74(2), 171–181 (1997)

    Article  MATH  Google Scholar 

  16. Delei, J., Sen, B., Wenming, D.: An ant colony optimization algorithm for knight’s tour Problem on the chessboard with holes. First International Workshop on Education Technology and Computer Science, pp. 292–296 (2009)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Chongqing University, Chongqing, China

    Yu Xiong & Zhongyang Xiong

  2. School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China

    Yu Xiong, Dapeng Wu & Yang Li

Authors
  1. Yu Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhongyang Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dapeng Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu Xiong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xiong, Y., Xiong, Z., Wu, D. et al. Multi-fault aware parallel localization protocol for backbone network with many constraints. Photon Netw Commun 24, 210–218 (2012). https://doi.org/10.1007/s11107-012-0381-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-012-0381-z

Keywords

Search

Navigation