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

Authors:
Yu Xiong;Zhongyang Xiong;Dapeng Wu;Yang Li
Affiliations:
School of Computer Science, Chongqing University, Chongqing, China and School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China;School of Computer Science, Chongqing University, Chongqing, China;School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China;School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China
Venue:
Photonic Network Communications
Year:
2012

Citing 9
Cited 0

Bounds on the number of knight's tours

Discrete Applied Mathematics
An Ant Colony Optimization Algorithm for Knight's Tour Problem on the Chessboard with Holes

ETCS '09 Proceedings of the 2009 First International Workshop on Education Technology and Computer Science - Volume 01
A Fast Fault Location Algorithm Based on Pre-computed for Optical Burst Switching Network

ICCSN '09 Proceedings of the 2009 International Conference on Communication Software and Networks
An Effective Multi-fault Localization Algorithm for Optical Networks

IITAW '09 Proceedings of the 2009 Third International Symposium on Intelligent Information Technology Application Workshops
Distributed multi-failure localization protocol for all-optical networks

ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Optimal algorithms for constructing knight's tours on arbitrary n×m chessboards

Discrete Applied Mathematics
Optimal solutions for single fault localization in two dimensional lattice networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Diverse routing in networks with probabilistic failures

IEEE/ACM Transactions on Networking (TON)
Adjacent link failure localization with monitoring trails in all-optical mesh networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

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.