(2003) The Use of Enumerative Techniques in Topological Optimization of Computer Networks Subject to Fault Tolerance and Reliability. Infocomm. pp. 1-7.
|
PDF (Infocomm 2003)
infocom_enum_paper.pdf Download (126kB) | Preview |
Abstract
Topological optimization of computer networks is concerned with the design of a network by selecting a subset of the available set of links such that the fault tolerance and reliability aspects are maximized while a cost constraint is met. A number of enumeration-based techniques were proposed to solve this problem. They are based on enumerating all the possible paths (for Terminal reliability) and all the spanning trees (for ��Network reliability). Existing enumeration-based techniques for solving this network optimization problem ignore the fault-tolerance aspect in their solution. Fault tolerance is an important network design aspect. A fault tolerant network is able to function even in the presence of some faults in the network. In this paper, we propose one algorithm for optimizing the terminal reliability and another for optimizing the network reliability while improving the fault tolerance aspects of the designed networks. Experimental results obtained from a set of randomly generated networks using the proposed algorithms are presented and compared to those obtained using the existing techniques [1], [2]. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability however at the expense of a reasonable increase in the overall cost of the network while remaining within a maximum pre-specified cost constraint.
| Item Type: | Article |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | AHMER ZAKIR |
| Date Deposited: | 10 Mar 2008 11:35 |
| Last Modified: | 01 Nov 2019 13:23 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/263 |