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