This Article 
 Bibliographic References 
 Add to: 
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches
November 1999 (vol. 10 no. 11)
pp. 1138-1158

Abstract—Cut-through switching promises low latency delivery and has been used in new generation switches, especially in high speed networks demanding low communication latency. The interconnection of cut-through switches provides an excellent network platform for high speed local area networks (LANs). For cost and performance reasons, irregular topologies should be supported in such a switch-based network. Switched irregular networks are truly incrementally scalable and have potential to be reconfigured to adapt to the dynamics of network traffic conditions. Due to the arbitrary topologies of networks, it is critical to develop an efficient deadlock-free routing algorithm. A novel deadlock-free adaptive routing algorithm called adaptive-trail routing is proposed to allow irregular interconnection of cut-through switches. The adaptive routing algorithm is based on two unidirectional adaptive trails constructed from two opposite unidirectional Eulerian trails. Some heuristics are suggested in terms of the selection of Eulerian trails, the avoidance of long routing paths, and the degree of adaptivity. Extensive simulation experiments are conducted to evaluate the performance of the proposed and two other routing algorithms under different topologies and traffic workloads.

[1] L.M. Ni, “Issues in Designing Truly Scalable Interconnection Networks,” Proc. 1996 ICPP Workshop on Challenges for Parallel Processing, Aug. 1996.
[2] R.J. Souza et al., “The GIGA Switch System: A High-Performance Packet Switching Platform,” Digital Technical J., vol. 6, Jan. 1994.
[3] Ancor Comm. Inc., ~prechelt/Biblio/ http://www.ancor.comcxt.html.
[4] T.W. Giorgis, “29 Switching Hubs Save the Bandwidth,” BYTE, pp. 162-169, July 1995.
[5] N. Boden et al., "Myrinet: A Gigabit-per-Second Local Area Network," IEEE Micro, Feb. 1995, pp. 29-36.
[6] C.B. Stunkel et al., “The SP1 High-Performance Switch,” Proc. Scalable High-Performance Computing Conf., CS Press, May 1994, pp. 150-157.
[7] “Cray T3D System Architecture Overview,” technical report, Cray Research Inc., Sept. 1993.
[8] M.D. Noakes, D.A. Wallach, and W.J. Dally, "The J-Machine Multicomputer: An Architectural Evaluation," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 224-235, May 1993.
[9] B. Duzett and R. Buck, "An Overview of the nCUBE3 Supercomputer," Proc. Fourth Symp. Frontiers of Massively Parallel Computation, pp. 458-464, 1992.
[10] Paragon XP/S Product Overview, technical report, Intel Corp., 1991.
[11] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[12] R. Horst, “ServerNet Deadlock Avoidance and Fractahedral Topologies,” Proc. Int'l Parallel Processing Symp., pp. 274–280, Apr. 1996.
[13] S.S. Owicki and A.R. Karlin, “Factors in the Performance of the AN1 Computer Network,” Performance Evaluation Rev., vol. 20, pp. 167-180, June 1992.
[14] L. Cherkasova, V. Kotov, and T. Rokicki, “Fibre Channel Fabrics: Evaluation and Design,” Proc. 29th Hawaii Int'l Conf. System Sciences, Feb. 1995.
[15] W. Qiao and L.M. Ni, “Adaptive Routing in Irregular Networks Using Cut-Through Switches,” Proc. 1996 Int'l Conf. Parallel Processing, Aug. 1996.
[16] M. Yang and L.M. Ni, “Design of Scalable and Multicast Capable Cut-Through Switches for High Speed LANs,” INFOCOM'97, Technical Report MSU-CPS-ACS-96-08, Dept. Computer Science, Michigan State Univ., E. Lansing, Mich., June 1996.
[17] P. Kermani and L. Kleinrock, “Virtual Cut-Through: A New Computer Communication Switching Technique,” Computer Networks, vol. 3, no. 4, 1979.
[18] R.O. Onvural, Asynchronous Transfer Mode Networks: Performance Issues, 1995.
[19] 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.
[20] C.J. Glass and L.M. Ni, “The Turn Model for Adaptive Routing,” J. ACM, vol. 41, no. 5, pp. 874-902, Sept. 1994.
[21] J. Duato, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 4, Nov. 1993.
[22] H. Park and D.P. Agrawal, “Generic Methodologies for Deadlock-Free Routing,” Proc. Int'l Parallel Processing Symp., pp. 638-643, Apr. 1996.
[23] K.V. Anjan, T.M. Pinkston, and J. Duato, Generalized Theory for Deadlock-Free Adaptive Routing and Its Application to Disha Concurrent Proc. 10th Int'l Parallel Processing Symp., Apr. 1996.
[24] X. Lin, P.K. McKinley, L.M. Ni, “The Message Flow Model for Routing in Wormhole-Routed Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 7, pp. 755–760, July 1995.
[25] W. Qiao and L.M. Ni, “Adaptive Routing in Irregular Networks Using Cut-Throughput Switches,” Technical Report MSU-CPS-ACS-108, Dept. Computer Science, Michigan State Univ., E. Lansing, Mich., Dec. 1995.
[26] F. Harary, Graph Theory. Reading, Mass.: Addison-Wesley, 1972.
[27] A.A. Chien and M. Konstantinidou, “Workload and Performance Metrics for Evaluating Parallel Interconnects,” IEEE Computer Architecture Technical Committee Newsletter, pp. 23-27, no. 2, 1994.

Index Terms:
Adaptive routing, cut-through switches, deadlock-free routing, irregular networks, incremental scalability, performance evaluation.
Wenjian Qiao, Lionel M. Ni, Tomas Rokicki, "Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 11, pp. 1138-1158, Nov. 1999, doi:10.1109/71.809573
Usage of this product signifies your acceptance of the Terms of Use.