Title :
Designing Fault Tolerant Networks Topologies Based on Greedy Algorithm
Author :
Zili, Deng ; Nenghai, Yu ; Zheng, Li
Author_Institution :
Univ. of Sci. & Technol. of China, Hefei
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.
Keywords :
computer networks; fault tolerance; greedy algorithms; minimisation; telecommunication network topology; computer network dependability; design problem; fault tolerant network topology; greedy algorithm; minimum cost network topology; Algorithm design and analysis; Computer network reliability; Computer networks; Costs; Fault tolerance; Fault tolerant systems; Greedy algorithms; Length measurement; Network topology; Telecommunication network reliability; Fault tolerant; Greedy algorithm; Topologies designing;
Conference_Titel :
Dependability of Computer Systems, 2008. DepCos-RELCOMEX '08. Third International Conference on
Conference_Location :
Szklarska Poreba
Print_ISBN :
978-0-7695-3179-3
DOI :
10.1109/DepCoS-RELCOMEX.2008.35
