The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Generalized loop-back recovery in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Generating random spanning trees
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Single-link failure detection in all-optical networks using monitoring cycles and paths
IEEE/ACM Transactions on Networking (TON)
Optimal solutions for single fault localization in two dimensional lattice networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
M2-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Cross-layer survivability in WDM-based networks
IEEE/ACM Transactions on Networking (TON)
Active monitoring and alarm management for fault localization in transparent all-optical networks
IEEE Transactions on Network and Service Management
Optical Layer Monitoring Schemes for Fast Link Failure Localization in All-Optical Networks
IEEE Communications Surveys & Tutorials
An efficient algorithm for locating soft and hard failures in WDM networks
IEEE Journal on Selected Areas in Communications
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
Quality of resilience as a network reliability characterization tool
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Monitoring trail (m-trail) has been proposed as an effective approach for link failure localization in all-optical wavelength division multiplexing (WDM) mesh networks. Previous studies in failure localization rely on alarm dissemination via control plane signaling such that the network controller can collect the flooded alarms to form an alarm code for failure identification. Such cross-layer signaling effort obviously leads to additional control complexity. This paper investigates a novel m-trail failure localization scenario, called network-wide local unambiguous failure localization (NWL-UFL), where each node can perform UFL based on locally available ON-OFF state of traversing m-trails, such that alarm dissemination in the control plane can be completely avoided. The paper first defines and formulates the m-trail allocation problem under NWL-UFL and conducts a series of bound analysis on the cover length required for localizing any single-link failure. This is the first study on monitoring trail allocation problem that aims to gain understanding on the consumed cover length via analytical approaches due to the special feature of the NWL-UFL scenario. A novel heuristic algorithm based on random spanning tree assignment (RSTA) and greedy link swapping (GLS) is developed for solving the formulated problem. Extensive simulation on thousands of randomly generated network topologies is conducted to verify the proposed scheme by comparing it to a naive counterpart and with the derived lower bounds. We also demonstrate the impact of topology diversity on the performance of the proposed scheme as well as its scalability regarding network sizes.