Paper Info
Title
An efficient fault-tolerant routing methodology for fat-tree interconnection networks
Abstract
In large cluster-based machines, fault-tolerance in the interconnection network is an issue of growing importance, since their increasing size rises the probability of failure. The topology used in these machines is usually a fat-tree. This paper proposes a new distributed fault-tolerant routing methodology for fattrees. It does not require additional network hardware. It is scalable, since the required memory, switch hardware and routing delay do not depend on the network size. The methodology is based on enhancing the Interval Routing scheme with exclusion intervals. Exclusion intervals are associated to each switch output port, and represent the set of nodes that are unreachable from this port after a failure appears. We propose a mechanism to identify the exclusion intervals that must be updated after detecting a failure, and the values to write on them. Our methodology is able to support a relatively high number of network failures with a low degradation in network performance.
Year
DOI
Venue
2007
10.1007/978-3-540-74742-0_46
ISPA
Keywords
Field
DocType
fault tolerant,network performance
Multipath routing,Link-state routing protocol,Hierarchical routing,Policy-based routing,Static routing,Computer science,Computer network,Routing domain,Real-time computing,Routing table,Distributed computing,Routing protocol
Conference
Volume
ISSN
ISBN
4742
0302-9743
3-540-74741-9
Citations 
PageRank 
References 
7
0.56
15
Authors
4
Name
Order
Citations
PageRank
Crispín Gómez Requena116012.57
María Engracia Gómez214917.48
Pedro López323316.39
José Duato43481294.85