Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/INFOCOM.2014.6848125 | Toronto, ON |
Keywords | DocType | Volume |
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 | Journal | 64 |
Issue | ISSN | Citations |
6 | 0743-166X | 1 |
PageRank | References | Authors |
0.40 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| János Tapolcai | 1 | 364 | 41.42 |
| Lajos Rónyai | 2 | 397 | 52.05 |
| Eva Hosszu | 3 | 11 | 3.29 |
| Pin-Han Ho | 4 | 3020 | 233.38 |
| Suresh Subramaniam | 5 | 1050 | 124.36 |