Abstracl-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 as@ are madmized while a cost co-t is met. A number of enumeration-based tecbniqnes were proposed to solve this problem. They are based on enumerating all possible path (for Terminal reliability) and all the spanning trees (for Network reliability). Existing enumeration-based techniques for solving this network optimization problem ignore the faulttolerance aspect in their solution. We consider fault tolerance to be an important network design aspect In this paper, we propose one algorithm for optimizing the terminal reliability and another for optimizing the network reliability while improving the fanlt 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 existing tedmiques. It is shown that improving the fault tolerance of a network can be achieved while optimizing its reliability bowever at the expense of a reasonable increase in the overall cos of the network. Keywords: Topological optimization of Networks, Fault Tolerance, Reliability, Enumerative Techniques, Spanning Trees, Computer Networks.
展开▼
