Edge-Colored Graphs with Applications To Homogeneous Faults
Discrete Mathematics
2012-07-24 v1 Information Theory
Combinatorics
math.IT
Abstract
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements of networks for being robust against homogeneous faults within certain thresholds. In particular, necessary and sufficient conditions for most interesting cases are obtained. For example, we will study the following cases: (1) the number of colors (or the number of non-homogeneous network device types) is one more than the homogeneous fault threshold; (2) there is only one homogeneous fault (i.e., only one color could fail); and (3) the number of non-homogeneous network device types is less than five.
Keywords
Cite
@article{arxiv.1207.5439,
title = {Edge-Colored Graphs with Applications To Homogeneous Faults},
author = {Yongge Wang and Yvo Desmedt},
journal= {arXiv preprint arXiv:1207.5439},
year = {2012}
}