Paper Info
Title
Constructions for unambiguous node failure localization in grid topologies
Abstract
Precise, fast and scalable fault localization is a highly desired feature in all optical mesh networks. The monitoring trail (m-trail) framework has been long in use for centralized failure localization, its capabilities were recently utilized to accommodate the distributed scenario as well. Most of the prior art focused solely on link failures; in this study we step further and analyze node failures only. Node failures are fundamentally different from link failures, and thus a new theoretical framework is developed. In particular, we are interested in the scalability of localizing node failures. From an information theoretic view, with b m-trails at most 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">b</sup> -1 single failures can be identified. This intuitively leads to a very attractive property that the number of monitors might be logarithmic to the size of the network. Does this logarithmic behaviour holds for real life topologies too? As a step towards the answer, we show tight constructions for both centralized and distributed node failure localization.
Year
DOI
Venue
2015
10.1109/RNDM.2015.7325233
2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)
Keywords
Field
DocType
unambiguous node failure localization,grid topologies,scalable fault localization,optical mesh networks,monitoring trail,m-trail framework,link failures,node failures,logarithmic behaviour,distributed node failure localization
Mesh networking,All optical,Computer network,Network topology,Engineering,Logarithm,Grid,Scalability,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4673-8050-8
0
0.34
References 
Authors
5
3
Name
Order
Citations
PageRank
Laszlo Gyimothi110.69
Eva Hosszu2113.29
János Tapolcai336441.42