loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 11
Validation of NetRec — A Dynamic Reconfiguration Algorithm for Irregular Topologies in Presence of Multiple Failures
Santa Fe, New Mexico
April 26-April 30
ISBN: 0-7695-2132-0
N. Natchev, Northeastern University
D. Avresky, Northeastern University

Component failures in high-speed local and system area networks can result in signi.cant topological changes. In such cases, a network reconfiguration algorithm is executed to restore the connectivity. Most of the current networks use either static reconfiguration algorithms or stop the user traffic to prevent cyclic dependencies in the routing tables.

The goal of this paper is to validate an extension of the dynamic reconfiguration algorithm NetRec, which was previously published by the authors. The extensions is designed to increase the network availability in the presence of multiple link and node failures. It updates the routing tables asynchronously and doesn?t require any global knowledge about the network topology. Certain phases of NetRec are executed in parallel, thus reducing the reconfiguration time. We present results from validation of the algorithm in a distributed network testbed, based on the MPI 1.2 features for building virtual topologies.

Citation:
N. Natchev, D. Avresky, "Validation of NetRec — A Dynamic Reconfiguration Algorithm for Irregular Topologies in Presence of Multiple Failures," ipdps, vol. 12, pp.209a, 18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 11, 2004
Usage of this product signifies your acceptance of the Terms of Use.