The Community for Technology Leaders
Dependability of Computer Systems, International Conference on (2008)
June 26, 2008 to June 28, 2008
ISBN: 978-0-7695-3179-3
pp: 227-234
ABSTRACT
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.
INDEX TERMS
Fault tolerant, Topologies designing, Greedy algorithm
CITATION

L. Zheng, Y. Nenghai and D. Zili, "Designing Fault Tolerant Networks Topologies Based on Greedy Algorithm," Dependability of Computer Systems, International Conference on(DEPCOS-RELCOMEX), vol. 00, no. , pp. 227-234, 2008.
doi:10.1109/DepCoS-RELCOMEX.2008.35
82 ms
(Ver 3.3 (11022016))