Validation of NetRec - a dynamic reconfiguration algorithm for irregular topologies in presence of multiple failures

Summary form only given. Component failures in high-speed local and system area networks can result in significant topological changes. In such cases, a network reconfiguration algorithm is executed to restore the connectivity. Most of the current networks use either static reconfiguration algorithm...

Full description

Saved in:
Bibliographic Details
Main Authors: Natchev, N., Avresky, D.
Format: Conference Proceeding
Language:English
Subjects:
Broadcasting
Chaotic communication
Heuristic algorithms
Intelligent networks
Network topology
Routing
System recovery
Telecommunication traffic
Testing
Traffic control
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary form only given. Component failures in high-speed local and system area networks can result in significant 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 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.
DOI:10.1109/IPDPS.2004.1303238