Paper Info
Title
Designing Fault Tolerant Networks Topologies Based on Greedy Algorithm
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.
Year
DOI
Venue
2008
10.1109/DepCoS-RELCOMEX.2008.35
DepCoS-RELCOMEX
Keywords
Field
DocType
fault tolerant network topology,important parameter,computer network dependability,required network tolerance,designing fault tolerant networks,fault tolerant,greedy algorithm,telecommunication network topology,fault tolerance,tolerant network topologies design,computer networks,greedy algorithms,computer network,minimisation,design problem,topologies designing,minimum cost network topology,network topology,length measurement,algorithm design and analysis
Dependability,Computer science,Network topology,Greedy algorithm,Minimisation (psychology),Fault tolerance,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-0-7695-3179-3
0
0.34
References 
Authors
11
3
Name
Order
Citations
PageRank
Zi-li Deng151444.75
Nenghai Yu22238183.33
Zheng Li31159.88