Performance evaluation of dynamic reconfiguration in high-speed local area networks
|Type of Publication:||In Proceedings||Keywords:||Algorithms;Computer simulation;Computer system recovery;Distributed computer systems;Multimedia systems;Packet switching;Quality of service;Real time systems;|
|Pages:||85 - 96|
Dynamic reconfiguration;High speed networks;Network interface card;
A new deadlock-free distributed reconfiguration algorithm that is able to asynchronously update routing tables without stopping the user traffic is proposed. This algorithm is valid for any topology, including regular as well as irregular topologies. Simulation results show that the behavior of such algorithm is significantly better than for other algorithms based on a spanning-tree formation.