Title
Fast routing computation on InfiniBand networks
Abstract
The InfiniBand architecture has been proposed as a technology both for communication between processing nodes and I/O devices, and for interprocessor communication. Its specification defines a basic management infrastructure that is responsible for subnet configuration and fault tolerance. Each time a topology change is detected, new forwarding tables have to be computed and uploaded to devices. The time required to compute these tables is a critical issue, due to application traffic is negatively affected by the temporary lack of connectivity. In this paper, we show the way to integrate several routing algorithms, in order to combine their advantages. In particular, we merge a new proposal, characterized by its high computation speed but low efficiency, with a traditional one, slower but more efficient. Our goal is to provide new routes in a short period of time, minimizing the degradation mentioned before, and maintaining, at the same time, high network performance.
Year
DOI
Venue
2006
10.1109/TPDS.2006.35
Parallel and Distributed Systems, IEEE Transactions
Keywords
Field
DocType
computational complexity,fault tolerance,multiprocessor interconnection networks,network routing,I/O devices,InfiniBand network architecture,fault tolerance,interprocessor communication,network performance,routing computation,subnet configuration,High-speed LANs,network management,network topology,routing protocols.
InfiniBand,Computer science,Computer network,Real-time computing,Network topology,Subnet,Fault tolerance,Network management,Distributed computing,Computational complexity theory,Network performance,Routing protocol
Journal
Volume
Issue
ISSN
17
3
1045-9219
Citations 
PageRank 
References 
14
0.74
11
Authors
4
Name
Order
Citations
PageRank
a alvis bermudez1140.74
Rafael Casado213913.42
Quiles, F.J.3241.91
José Duato43481294.85