Signaling Free Localization of Node Failures in All-Optical Networks

J. Tapolcai, L. Rónyai, Eva Hosszu, Laszlo Gyimothi, Pin Han Ho, Suresh Subramaniam

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Network-wide local unambiguous failure localization (NL-UFL) has been demonstrated as an interesting scenario of monitoring trails (m-trails). It attempts to enable every node to autonomously localize any failure event in the network in a distributed and all-optical manner by inspecting a set of m-trails traversing through the node. This paper investigates the m-trail allocation problem under the NL-UFL scenario by taking each link and node failure event into consideration. Bound analysis is performed using combinatorial group testing (CGT) theory and this is followed by the introduction of a novel heuristic on general topologies. Extensive simulation is conducted to examine the proposed heuristic in terms of the required cover length and the number of m-trails to achieve NL-UFL.

Original languageEnglish
Article number7445186
Pages (from-to)2527-2538
Number of pages12
JournalIEEE Transactions on Communications
Volume64
Issue number6
DOIs
Publication statusPublished - Jun 1 2016

Fingerprint

Fiber optic networks
Monitoring
Topology
Testing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Signaling Free Localization of Node Failures in All-Optical Networks. / Tapolcai, J.; Rónyai, L.; Hosszu, Eva; Gyimothi, Laszlo; Ho, Pin Han; Subramaniam, Suresh.

In: IEEE Transactions on Communications, Vol. 64, No. 6, 7445186, 01.06.2016, p. 2527-2538.

Research output: Contribution to journalArticle

Tapolcai, J. ; Rónyai, L. ; Hosszu, Eva ; Gyimothi, Laszlo ; Ho, Pin Han ; Subramaniam, Suresh. / Signaling Free Localization of Node Failures in All-Optical Networks. In: IEEE Transactions on Communications. 2016 ; Vol. 64, No. 6. pp. 2527-2538.
@article{0002818dc54344e7b72ccd5b41198dd4,
title = "Signaling Free Localization of Node Failures in All-Optical Networks",
abstract = "Network-wide local unambiguous failure localization (NL-UFL) has been demonstrated as an interesting scenario of monitoring trails (m-trails). It attempts to enable every node to autonomously localize any failure event in the network in a distributed and all-optical manner by inspecting a set of m-trails traversing through the node. This paper investigates the m-trail allocation problem under the NL-UFL scenario by taking each link and node failure event into consideration. Bound analysis is performed using combinatorial group testing (CGT) theory and this is followed by the introduction of a novel heuristic on general topologies. Extensive simulation is conducted to examine the proposed heuristic in terms of the required cover length and the number of m-trails to achieve NL-UFL.",
author = "J. Tapolcai and L. R{\'o}nyai and Eva Hosszu and Laszlo Gyimothi and Ho, {Pin Han} and Suresh Subramaniam",
year = "2016",
month = "6",
day = "1",
doi = "10.1109/TCOMM.2016.2545653",
language = "English",
volume = "64",
pages = "2527--2538",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Signaling Free Localization of Node Failures in All-Optical Networks

AU - Tapolcai, J.

AU - Rónyai, L.

AU - Hosszu, Eva

AU - Gyimothi, Laszlo

AU - Ho, Pin Han

AU - Subramaniam, Suresh

PY - 2016/6/1

Y1 - 2016/6/1

N2 - Network-wide local unambiguous failure localization (NL-UFL) has been demonstrated as an interesting scenario of monitoring trails (m-trails). It attempts to enable every node to autonomously localize any failure event in the network in a distributed and all-optical manner by inspecting a set of m-trails traversing through the node. This paper investigates the m-trail allocation problem under the NL-UFL scenario by taking each link and node failure event into consideration. Bound analysis is performed using combinatorial group testing (CGT) theory and this is followed by the introduction of a novel heuristic on general topologies. Extensive simulation is conducted to examine the proposed heuristic in terms of the required cover length and the number of m-trails to achieve NL-UFL.

AB - Network-wide local unambiguous failure localization (NL-UFL) has been demonstrated as an interesting scenario of monitoring trails (m-trails). It attempts to enable every node to autonomously localize any failure event in the network in a distributed and all-optical manner by inspecting a set of m-trails traversing through the node. This paper investigates the m-trail allocation problem under the NL-UFL scenario by taking each link and node failure event into consideration. Bound analysis is performed using combinatorial group testing (CGT) theory and this is followed by the introduction of a novel heuristic on general topologies. Extensive simulation is conducted to examine the proposed heuristic in terms of the required cover length and the number of m-trails to achieve NL-UFL.

UR - http://www.scopus.com/inward/record.url?scp=84976569866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976569866&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2016.2545653

DO - 10.1109/TCOMM.2016.2545653

M3 - Article

AN - SCOPUS:84976569866

VL - 64

SP - 2527

EP - 2538

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 6

M1 - 7445186

ER -