Optimal solutions for single fault localization in two dimensional lattice networks

Authors:
János Tapolcai;Lajos Rónyai;Pin-Han Ho
Affiliations:
Dept. of Telecommunications and Media Informatics, BME;Computer and Automation Research Institute Hungarian Academy of Sciences MTA SZTAKI, 2nd Inst. of Mathematics, Budapest University of Technology and Economics;Dept. of Electrical and Computer Engineering, University of Waterloo, Canada
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 4
Cited 4

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Single-link failure detection in all-optical networks using monitoring cycles and paths

IEEE/ACM Transactions on Networking (TON)
Management and control of transparent optical networks

IEEE Journal on Selected Areas in Communications
Failure Location Algorithm for Transparent Optical Networks

IEEE Journal on Selected Areas in Communications

A novel approach for failure localization in all-optical mesh networks

IEEE/ACM Transactions on Networking (TON)
Multi-fault aware parallel localization protocol for backbone network with many constraints

Photonic Network Communications
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails

IEEE/ACM Transactions on Networking (TON)
Localizing link failures in all-optical networks using monitoring tours

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting method that has been introduced as the most general monitoring structure for achieving unambiguous failure localization (UFL). Ideally, with J m-trees one can monitor up to 2J - 1 links when a single failure has to be located. Such a logarithmic behavior has also been observed in numerous case studies of real life network topologies [1], [2]. It is expected that the m-tree framework will lead to a highly scalable link failure monitoring mechanism for not only all-optical mesh networks, but any possible future information system with mesh topologies, such as all-optical mesh networks, touch panels, quantum computing, and VLSI. It is an important task to investigate the extent such an optimal logarithmic behavior may hold, in particular in practically relevant network topologies. As an endeavor toward this goal, the paper investigates the problem by identifying essentially tight logarithmic bounds for two dimensional lattice networks. Experiments are conducted to show the feasibility and performance of the proposed constructions.