Performance evaluation of dynamic reconfiguration in high-speed local area networks

High-speed local area networks (LANs) consist of a set of switches connected by point-to-point links, and hosts linked to switches through a network interface card. High-speed LANs may change their topology due to switches and hosts being turned on/off, link remapping, and component failures. In these cases, a distributed reconfiguration algorithm analyzes the topology, computes the new routing tables, and downloads them to the corresponding switches. Unfortunately, in most cases, user traffic is stopped during the reconfiguration process to avoid deadlock. Although network reconfigurations are not frequent, static reconfiguration such as this may take hundreds of milliseconds to execute, thus degrading system availability significantly. In this paper, we propose a new deadlock-free distributed reconfiguration algorithm that is able to asynchronously update routing tables without stopping user traffic. This algorithm is valid for any topology, including regular as well as irregular topologies. Simulation results show that the behavior of our algorithm is significantly better than for other algorithms based on a spanning-tree formation.

[1]  Robert W. Horst.  TNet: A Reliable System Area Network , 1995, IEEE Micro.

[2]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[3]  Federico Silla,et al.  Improving the efficiency of adaptive routing in networks with irregular topology , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[4]  Anna R. Karlin,et al.  Factors in the performance of the AN1 computer network , 1992, SIGMETRICS '92/PERFORMANCE '92.

[5]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[6]  José Duato,et al.  University of Castilla-La Mancha A publication of the Department of Computer Science An Efficient Protocol for Dynamic Reconfiguration in Irregular Networks , .

[7]  Gregory F. Pfister,et al.  In Search of Clusters , 1995 .

[8]  Antonio Robles,et al.  Efficient Adaptive Routing in Networks of Workstations with Irregular Topology , 1997, CANPC.

[9]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Michael D. Schroeder,et al.  Automatic reconfiguration in Autonet , 1991, SOSP '91.

[12]  Gunnar Karlsson,et al.  Asynchronous transfer of video , 1996, IEEE Commun. Mag..

[13]  James R. Goodman,et al.  The Impact of Pipelined Channels on k-ary n-Cube Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Edward W. Knightly,et al.  D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic , 1997, TNET.

[15]  Bülent Abali,et al.  A Deadlock Avoidance Method for Computer Networks , 1997, CANPC.

[16]  Lionel M. Ni,et al.  Adaptive routing in irregular networks using cut-through switches , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[17]  Pedro Cuenca,et al.  A Tool for the Analysis of Reconfiguration and Routing Algorithms in Irregular Networks , 1998, CANPC.