Dynamically Scaling Computer Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism
Proceedings of the 31st annual international symposium on Computer architecture
IEEE Transactions on Computers
Part I: A Theory for Deadlock-Free Dynamic Network Reconfiguration
IEEE Transactions on Parallel and Distributed Systems
Handling Topology Changes in InfiniBand
IEEE Transactions on Parallel and Distributed Systems
RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Simple deadlock-free dynamic network reconfiguration
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 0.00 |
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.