Designing Fault Tolerant Networks Topologies Based on Greedy Algorithm
Deng Zili, Nenghai Yu, Zheng Li · 2008
Fault tolerance is an important parameter to measure the dependability of computer networks. Usually the tolerant network topologies design problem is to find a minimum cost network topology subject to a required network tolerance. In this paper three approaches based on greedy algorithm are proposed to solve this problem. Simulations are implemented to support the effectiveness of these approaches, comparison are presented to evaluate their performance.