Analysis and design of Banyan and crossbar switches with bypass queues

Bypass queueing can overcome the problem of head of line blocking within an input queue. We study two different approaches for providing a bypass function in input buffers. They are look-through and look-back service disciplines, both of which can prevent out of sequence situations. Under uniform traffic, if the switch size is large, these two disciplines obtain almost the same throughput. However, under nonuniform traffic, especially a hot-spot traffic pattern, the look-through will achieve a much better throughput than look-back policy. This paper presents the throughput analysis and simulations for crossbar and Banyan switches under uniform and nonuniform traffic. Furthermore, to reduce contention across input queues, the parallel-plane ATM switch with bypass queues is also discussed and analyzed.

[1]  Jonathan S. Turner,et al.  Performance of a broadcast packet switch , 1989, IEEE Trans. Commun..

[2]  E.W. Zegura,et al.  Architectures for ATM switching systems , 1993, IEEE Communications Magazine.

[3]  Fouad A. Tobagi,et al.  The Christmas-tree switch: an output queuing space-division fast packet switch based on interleaving distribution and concentration functions , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[4]  Alberto Leon-Garcia,et al.  Performance of buffered banyan networks under nonuniform traffic patterns , 1990, IEEE Trans. Commun..

[5]  Anthony S. Acampora,et al.  The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching , 1987, IEEE J. Sel. Areas Commun..

[6]  Masayuki Murata,et al.  Performance evaluation of cell bypass queueing discipline for buffered Banyan type ATM switches , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[7]  Kai Y. Eng,et al.  A Knockout Switch for Variable-Length Packets , 1987, IEEE J. Sel. Areas Commun..

[8]  Fouad A. Tobagi,et al.  Fast packet switch architectures for broadband integrated services digital networks , 1990, Proc. IEEE.

[9]  Peter Newman.  A fast packet switch for the integrated services backbone network , 1988, IEEE J. Sel. Areas Commun..

[10]  Masayuki Murata,et al.  Survey of switching techniques in high-speed networks and their performance , 1991 .

[11]  Yih-Chyun Jenq,et al.  Performance Analysis of a Packet Switch Based on Single-Buffered Banyan Network , 1983, IEEE J. Sel. Areas Commun..

[12]  Hamid Ahmadi,et al.  A survey of modern high-performance switching techniques , 1989, IEEE J. Sel. Areas Commun..

[13]  Joseph Y. Hui,et al.  A Broadband Packet Switch for Integrated Transport , 1987, IEEE J. Sel. Areas Commun..

[14]  Satoshi Nojima,et al.  Integrated Services Packet Network Using Bus Matrix Switch , 1987, IEEE J. Sel. Areas Commun..

[15]  Jau-Hsiung Huang,et al.  Throughput analysis and optimal design of Banyan switches with bypass queues , 1994, IEEE Trans. Commun..

[16]  Kai Y. Eng,et al.  A growable packet (ATM) switch architecture: design principles and application , 1992, IEEE Trans. Commun..

[17]  Thomas G. Robertazzi.  Performance Analysis of a Packet Switch Based on SingleBuffered Banyan Network , 1993 .

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

[19]  Ken W. Sarkies.  The bypass queue in fast packet switching , 1991, IEEE Trans. Commun..

[20]  Mark J. Karol,et al.  A growable packet (ATM) switch architecture: design principles and applications , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.