Factors in the performance of the AN1 computer network

AN1 (formerly known as Autonet) is a local area network composed of crossbar switches interconnected by 100Mbit/second, full-duplex links. In this paper, we evaluate the performance impact of certain choices in the AN1 design. These include the use of FIFO input buffering in the crossbar switch, the deadlock-avoidance mechanism, cut-through routing, back-pressure for flow control, and multi-path routing. AN1's performance goals were to provide low latency and high bandwidth in a lightly loaded network. In this it is successful. Under heavy load, the most serious impediment to good performance is the use of FIFO input buffers. The deadlock-avoidance technique has an adverse effect on the performance of some topologies, but it seems to be the best alternative, given the goals and constraints of the AN1 design. Cut-through switching performs well relative to store-and-forward switching, even under heavy load. Back-pressure deals adequately with congestion in a lightly-loaded network; under moderate load, performance is acceptable when coupled with end-to-end flow control for bursts. Multi-path routing successfully exploits redundant paths between hosts to improve performance in the face of congestion.

[1]  Mark J. Karol,et al.  Queueing in high-performance packet switching , 1988, IEEE J. Sel. Areas Commun..

[2]  H. T. Mouftah,et al.  Delay Analysis Under a General Cut-Through Switching Technique in Computer Networks , 1987, IEEE Trans. Commun..

[3]  San-qi Li,et al.  A study of traffic imbalances in a fast packet switch , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Lionel M. Ni,et al.  Adaptive routing in mesh-connected networks , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[5]  David C. Walden,et al.  The ARPA Network Design Decisions , 1977, Comput. Networks.

[6]  P. Merlin,et al.  Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.

[7]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[8]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[9]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[10]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[11]  San-qi Li,et al.  Nonuniform traffic analysis on a nonblocking space-division packet switch , 1990, IEEE Trans. Commun..

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

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

[14]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[15]  Wolfgang E. Denzel,et al.  Performance of packet switches with input and output queueing , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[16]  Jianwen Chen,et al.  Throughput reduction due to non-uniform traffic in a packet switch with input and output queueing , 1991, ICC 91 International Conference on Communications Conference Record.

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

[18]  Izhak Rubin,et al.  Path delays in communication networks , 1975 .

[19]  Raj Jain,et al.  Myths about Congestion Management in High Speed Networks , 1992, INDC.

[20]  Leonard Kleinrock,et al.  A Tradeoff Study of Switching Systems in Computer Communication Networks , 1980, IEEE Transactions on Computers.

[21]  Samuel P. Morgan,et al.  Input Versus Output Queueing on a Space-Division Packet Switch , 1987, IEEE Trans. Commun..

[22]  Alan Jay Smith,et al.  Interference in multiprocessor computer systems with interleaved memory , 1976, CACM.

[23]  Izhak Rubin.  An Approximate Time-Delay Analysis for Packet-Switching Communication Networks , 1976, IEEE Trans. Commun..

[24]  Achille Pattavina,et al.  Performance Evaluation of a Batcher-Banyan Interconnection Network with Output Pooling , 1991, IEEE J. Sel. Areas Commun..