loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Conference on Cluster Computing (CLUSTER'01)
Dynamic Reconfiguration in High-Speed Computer Clusters
Newport Beach, CA
October 08-October 11
ISBN: 0-7695-1116-3
D. Avresky, Northeastern University
N. Natchev, Northeastern University
V. Shurbanov, Northeastern University
High-speed local and system area networks may change their topology due to switching on/off of routers and hosts or due to component failures. In such cases, a reconfiguration algorithm must be executed to restore the network connectivity and thus achieve high system reliability. However, most of the solutions are based either on redundant network paths or on regular network topologies.The purpose of this paper is to specify NetRec, a novel algorithm for dynamically reconfiguring an arbitrary network topology when a permanent node fault occurs. Unlike other reconfiguration algorithms, NetRec is applicable for all high-speed computer networks and is compatible with all modern routing techniques, including wormhole-based system area networks. It restores the network connectivity by building a tree that spans all immediate neighbors of the faulty node that are still connected to the network. The algorithm is distributed and does not require any global knowledge.
Citation:
D. Avresky, N. Natchev, V. Shurbanov, "Dynamic Reconfiguration in High-Speed Computer Clusters," cluster, pp.380, Third IEEE International Conference on Cluster Computing (CLUSTER'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.