Sciweavers

Share
IPL
2011

Edge-colored graphs with applications to homogeneous faults

9 years 3 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored 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.
Yongge Wang, Yvo Desmedt
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where IPL
Authors Yongge Wang, Yvo Desmedt
Comments (0)
books