UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Edge-colored graphs with applications to homogeneous faults

Wang, YG; Desmedt, Y; (2011) Edge-colored graphs with applications to homogeneous faults. In: INFORM PROCESS LETT. (pp. 634 - 641). ELSEVIER SCIENCE BV

Full text not available from this repository.

Abstract

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. (C) 2011 Elsevier B.V. All rights reserved.

Type:Proceedings paper
Title:Edge-colored graphs with applications to homogeneous faults
DOI:10.1016/j.ipl.2011.03.017
Keywords:Graphs, Network security, Network reliability, Homogeneous faults, Fault tolerance, SPANNING-TREES, COMMUNICATION
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record