Nonblocking copy networks in multi-channel switching

This paper develops a copy network architecture that can maintain the cell sequence integrity in multi-channel ATM switching. The architecture is internally nonblocking in the sense that the copying process of cells is constrained only by the availability of output channels. By using a relative ordering among the inputs, shared buffering, and a new switching paradigm called the nonblocking binary group network, we show how the cell sequence integrity can be maintained. Next, assuming the fanout request values of cells are distributed independently from cell to cell, we formulate a method of analyzing the performance of the copy network. This method uses the technique of tagged Markov chains to derive the stationary distributions for the number of cells in the copy network from which, delay, throughput, and cell loss probability can be accurately calculated as critical performance measures. We conduct a numerical study for the proposed architecture using this method wherein the effects of key network and traffic variables such as buffer and network sizes, and the mean and the variance of fanout request values are determined under arbitrary types of fanout distribution. Finally, we quantify the performance improvement due to fanout splitting which allows the fanout request from a single cell to be satisfied over multiple time slots.

[1]  Achille Pattavina Multichannel bandwidth allocation in a broadband packet switch , 1988, IEEE J. Sel. Areas Commun..

[2]  John A. Silvester,et al.  Fixed-node routing architecture and its performance in ATM networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[3]  Jeffrey M. Jaffe,et al.  SNA Routing: Past, Present, and Possible Future , 1983, IBM Syst. J..

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

[5]  Michael G. Hluchyj,et al.  Multicast and broadcast services in a knockout packet switch , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[6]  Paul S. Min,et al.  A new structural property of statistical data forks , 1995, TNET.

[7]  Galen H. Sasaki,et al.  A Buffered Statistical Data Fork , 1996, Perform. Evaluation.

[8]  Yoshikuni Onozato,et al.  A copy network with shared buffers for large-scale multicast ATM switching , 1993, TNET.

[9]  M. S. Goodman,et al.  A broadband optical multicast switch , 1990, International Symposium on Switching.

[10]  Jonathan S. Turner,et al.  Design of a broadcast packet switching network , 1988, IEEE Trans. Commun..

[11]  Tony T. Lee Nonblocking copy networks for multicast packet switching , 1988, IEEE J. Sel. Areas Commun..

[12]  Paul S. Min,et al.  A nonblocking architecture for broadband multichannel switching , 1995, TNET.

[13]  N. L. Johnson,et al.  Distributions in Statistics: Discrete Distributions. , 1970 .

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

[15]  R. L. Cruz,et al.  The statistical data fork: a class of broad-band multichannel switches , 1992, IEEE Trans. Commun..

[16]  W. David Sincoskie,et al.  Sunshine: A High-Performance Self-Routing Broadband Packet Switch Architecture , 1991, IEEE J. Sel. Areas Commun..

[17]  Alberto Leon-Garcia,et al.  Design and analysis of a multilink access subsystem based on the Batcher-banyan network architecture , 1992, IEEE Trans. Commun..

[18]  Soung Chang Liew,et al.  Performance analysis of asymmetric packet switch modules with channel grouping , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[19]  Alberto Leon-Garcia,et al.  Nonblocking property of reverse banyan networks , 1992, IEEE Trans. Commun..