This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks
February 2001 (vol. 12 no. 2)
pp. 115-132

Abstract—High-speed local area networks (LANs) consist of a set of switches interconnected by point-to-point links, and hosts linked to those switches through a network interface card. High-speed LANs may change their topology due to switches being turned on/off, hot expansion, link remapping, and component failures. In these cases, a distributed reconfiguration protocol 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. These strategies are called static reconfiguration techniques. Although network reconfigurations are not frequent, static reconfiguration such as this may take hundreds of milliseconds to execute, thus degrading system availability significantly. Several distributed real-time applications have strict communication requirements. Distributed multimedia applications have similar, although less strict, quality of service (QoS) requirements [3], [4]. Both stopping packet transmission and discarding packets due to the reconfiguration process prevent the system from satisfying the above requirements. Therefore, in order to support hard real-time and distributed multimedia applications over a high-speed LAN, we need to avoid stopping user traffic and discarding packets when the topology changes. In this paper, we propose a new deadlock-free distributed reconfiguration protocol that is able to asynchronously update routing tables without stopping user traffic. This protocol is valid for any topology, including regular as well as irregular topologies. It is also valid for packet switching as well as for cut-through switching techniques and does not rely on the existence of virtual channels to work. Simulation results show that the behavior of our protocol is significantly better than for other protocols based on stopping user traffic.

[1] R. Casado, A. Bermúdez, F.J. Quiles, J.L. Sánchez, and J. Duato, “Performance Evaluation of Dynamic Reconfiguration in High-Speed Local Area Networks,” Proc. Sixth Symp. High Performance Computer Architecture (HPCA-6), Jan. 2000.
[2] R. Casado, F.J. Quiles, J.L. Sánchez, and J. Duato, “Deadlock-Free Routing in Irregular Networks with Dynamic Reconfiguration,” Proc. Workshop on Comm. and Architectural Support for Network-Based Parallel Computing, Jan. 1999.
[3] ATM Forum, ATM Forum Traffic Management Specification, Version 4.0, May 1995.
[4] H. Abut, Ed., Vector Quantization, IEEE Reprint Collection. Piscataway, N.J.: IEEE Press, May 1990.
[5] M.D. Schroeder, A.D. Birrell, M. Burrows, H. Murray, R.M. Needham, T.L. Rodeheffe, E.H. Satterthwaite, and C.P. Thacker, "Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links," IEEE J. Selected Areas in Comm., vol. 9, no. 8, pp. 1,318-1,335, Oct. 1991.
[6] N. Boden et al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Feb. 1995, pp. 29-36.
[7] D. Garcia, “ServerNet II,” Proc. 1997 Parallel Computing, Routing, and Comm. Workshop, June 1997.
[8] T.L. Rodeheffer and M.D. Schroeder, “Automatic Reconfiguration in Autonet,” Technical Report 77, SRC Research, Sept. 1991.
[9] S.S. Owicki and A.R. Karlin, “Factors in the Performance of AN1 Computer Network,” Technical Report 88, SRC Research, June 1992.
[10] E.W. Knightly and H. Zhang, “D-BIND: An Accurate Traffic Model for Providing QoS Guarantees to VBR Traffic,” IEEE Trans. on Networking, vol. 5, no. 2, Apr. 1995.
[11] G.F. Pfister, In Search of Clusters, second ed. New Jersey: Prentice Hall, 1998.
[12] R. Casado, M.B. Caminero, P. Cuenca, F.J. Quiles, A. Garrido, and J. Duato, “A Tool for the Analysis of Reconfiguration and Routing Algorithms in Irregular Networks,” Proc. Workshop on Comm. and Architectural Support for Network-Based Parallel Computing, Feb. 1998.
[13] P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communication Switching Technique,” Computer Networks, vol. 3, pp. 267–286, 1979.
[14] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[15] J. Duato, A. Robles, F. Silla, and R. Beivide, “A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOW Environment,” Proc. 13th Int'l Parallel Processing Symp., Apr. 1999.
[16] W. Qiao and L.M. Ni, “Adaptive Routing in Irregular Networks Using Cut-Through Switches,” Proc. 1996 Int'l Conf. Parallel Processing, Aug. 1996.
[17] F. Silla, M.P. Malumbres, A. Robles, P. López, and J. Duato, Efficient Adaptive Routing in Networks of Workstations with Irregular Topology Proc. Workshop Comm. and Architectural Support for Network-Based Parallel Computing, Feb. 1997.
[18] F. Silla and J. Duato, “Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology,” Proc. 1997 Int'l Conf. High Performance Computing, Dec. 1997.
[19] B. Abali, “A Deadlock Avoidance Method for Computer Networks,” Proc. First Int'l Workshop Comm. and Architectural Support for Network-Based Parallel Computing (CANPC '97), pp. 61-72, Feb. 1997.
[20] J. Duato, R. Casado, F.J. Quiles, and J.L. Sánchez, “Dynamic Reconfiguration in High Speed Local Area Networks” Dependable Network Computing. Kluwer, 1999.
[21] E. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerical Math., Oct. 1959.
[22] S. L. Scott, J.R. Goodman, The Impact of Pipelined Channels on K-Ary N-Cube Networks IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 2-16, Jan. 1994.
[23] A. Bermúdez, F.J. Alfaro, R. Casado, J. Duato, F.J. Quiles, and J.L. Sánchez, “Extending Dynamic Reconfiguration to Nows with Adaptive Routing,” Proc. Workshop on Comm. and Architectural Support for Network-Based Parallel Computing, Jan. 2000.

Index Terms:
Interconnection networks, irregular topologies, dynamic reconfiguration, deadlock avoidance, system availability.
Citation:
Rafael Casado, Aurelio Bermúdez, José Duato, Francisco J. Quiles, José L. Sánchez, "A Protocol for Deadlock-Free Dynamic Reconfiguration in High-Speed Local Area Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 2, pp. 115-132, Feb. 2001, doi:10.1109/71.910868
Usage of this product signifies your acceptance of the Terms of Use.