By Topic

Designing Fault Tolerant Networks Topologies Based on Greedy Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Deng Zili ; Univ. of Sci. & Technol. of China, Hefei ; Yu Nenghai ; Li Zheng

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.

Published in:

Dependability of Computer Systems, 2008. DepCos-RELCOMEX '08. Third International Conference on

Date of Conference:

26-28 June 2008