Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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