• DocumentCode
    170725
  • Title

    Signaling free localization of node failures in all-optical networks

  • Author

    Tapolcai, Janos ; Ronyai, Lajos ; Hosszu, Eva ; Pin-Han Ho ; Subramaniam, Suresh

  • Author_Institution
    MTA-BME Future Internet Res. Group, Budapest Univ. of Technol., Budapest, Hungary
  • fYear
    2014
  • fDate
    April 27 2014-May 2 2014
  • Firstpage
    1860
  • Lastpage
    1868
  • Abstract
    Network-wide local unambiguous failure localization (NL-UFL) [1] 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.
  • Keywords
    combinatorial mathematics; computer network reliability; fault location; optical fibre networks; all optical networks; combinatorial group testing theory; m-trail allocation problem; network wide local unambiguous failure localization; node failure; signaling free node localization; trail monitoring; Computers; Conferences; Monitoring; Observatories; Resource management; Testing; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2014 Proceedings IEEE
  • Conference_Location
    Toronto, ON
  • Type

    conf

  • DOI
    10.1109/INFOCOM.2014.6848125
  • Filename
    6848125