Speedup and buffer division in input/output queuing ATM switches

The capacity of a switch is built out of two factors: space parallelism and speedup. A switch has space parallelism if more than one input port can transmit simultaneously. Speedup is the ratio of the switch's internal link speed over the incoming link speed. An input-queuing switch uses only the first factor (space parallelism), and a share-medium or a share-memory output queuing switch uses only the second factor (speedup). However, to build a large switch, both factors are normally used. A large switch's capacity can be built with less space parallelism (the space factor), but more speedup (the time factor), or vise versa. Buffers are needed at both the input and the output ports. In this paper, we show how to divide the buffers between the input and the output queues and how the optimal division is affected by the (space, time) combinations.

[1]  Achille Pattavina,et al.  Analysis of input and output queueing for nonblocking ATM switches , 1993, TNET.

[2]  Hyong S. Kim,et al.  Efficient analysis of shared buffer management strategies in ATM networks under non-uniform bursty traffic , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Romano Fantacci,et al.  Performance evaluation of input and output queueing techniques in ATM switching systems , 1993, IEEE Trans. Commun..

[4]  Hamid Ahmadi,et al.  A high‐performance switch fabric for integrated circuit and packet switching , 1989 .

[5]  Sally Floyd,et al.  Dynamics of TCP Traffic over ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[6]  Masayuki Murata,et al.  Effect of speedup in nonblocking packet switch , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[7]  T. Meisling Discrete-Time Queuing Theory , 1958 .

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

[9]  Wolfgang E. Denzel,et al.  Analysis of packet switches with input and output queuing , 1993, IEEE Trans. Commun..

[10]  Xi-Ren Cao,et al.  Performance Analysis of a Nonblocking ATM Switch with a Bufferless Internal Speedup Fabric , 1998, Comput. Networks.

[11]  Soung Chang Liew Performance of various input-buffered and output-buffered ATM switch design principles under bursty traffic: simulation study , 1994, IEEE Trans. Commun..

[12]  Israel Cidon,et al.  Analysis of queueing displacement using switch port speedup , 1997, Proceedings of INFOCOM '97.

[13]  Myung J. Lee,et al.  Cell loss analysis and design trade-offs of nonblocking ATM switches with nonuniform traffic , 1995, TNET.

[14]  Xi-Ren Cao,et al.  The maximum throughput of a nonblocking space-division packet switch with correlated destinations , 1995, IEEE Trans. Commun..

[15]  Thomas E. Stern,et al.  Throughput Analysis, Optimal Buffer Allocation, and Traffic Imbalance Study of a Generic Nonblocking Packet Switch , 1991, IEEE J. Sel. Areas Commun..

[16]  Alberto Leon-Garcia,et al.  The single queue switch , 1997, Proceedings of INFOCOM '97.

[17]  S.-Q. Li Performance of a non-blocking space-division packet switch with correlated input traffic , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

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

[19]  Chi-Ying Tsui,et al.  A/I Net: a network that integrates ATM and IP , 1999 .

[20]  N. D. Georganas,et al.  Analysis of a packet switch with input and output buffers and speed constraints , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[21]  Hyong S. Kim,et al.  Comparison of buffer allocation schemes in ATM switches: complete sharing, partial sharing, and dedicated allocation , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.