Name
Abstract | ||
|---|---|---|
This paper deals with fast node failure localization in optical networks with monitoring trails (m-trails). It is based on Network-wide local unambiguous failure localization, which enables every node to autonomously localize any single node failure in the network in a distributed and all-optical manner by inspecting the m-trails traversing through the node. A new and innovative heuristic algorithm is presented which is based on recursion and constrained matching algorithms in general graphs. Extensive simulation is conducted to examine the proposed heuristic in terms of the required cover length to achieve NL-UFL. In our experiments the new heuristic can reduce the computation time by 1000-10000 times compared to prior art. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/HPSR.2015.7483088 | 2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR) |
Keywords | Field | DocType |
heuristic algorithm,network wide node failure localization,local unambiguous node failure localization,optical networks,single node failure,recursive algorithm,constrained matching algorithms,general graph | Graph,Heuristic,Computer science,Heuristic (computer science),Theoretical computer science,Fringe search,Recursion,Computation,Traverse | Conference |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| László Gyimóthi | 1 | 0 | 0.34 |
| János Tapolcai | 2 | 364 | 41.42 |