Dynamic connection rearrangements in ATM switching networks

Two classes of ATM (asynchronous transfer mode) switching network architectures based on preset path routing and on statistical self-routing switching techniques are considered. They are evaluated in terms of their basic properties and their capabilities to cope with point-to-multipoint connection requirements. The principles of connection rearrangement techniques in an ATM environment are described and possible applications in both classes of switching network architectures are evaluated. A preset path routing switch can gain considerably in performance for all types of connections at the expense of excessive control effort. A statistical self-routing switch can have advantages for point-to-multipoint connections with moderate additional effort.<<ETX>>

[1]  W. Verbiest,et al.  A statistical bandwidth allocation and usage monitoring algorithm for ATM networks , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[2]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[3]  D. Boettle,et al.  Switching network architecture for atm based broadband communications , 1990, International Symposium on Switching.

[4]  U. Ziegler,et al.  A versatile ATM switch concept , 1990, International Symposium on Switching.

[5]  Lars Dittmann,et al.  Load control in atm networks , 1990, International Symposium on Switching.

[6]  Nicholas Pippenger,et al.  On Rearrangeable and Non-Blocking Switching Networks , 1978, J. Comput. Syst. Sci..

[7]  F. K. Hwang Three-stage multiconnection networks which are nonblocking in the wide sense , 1979, The Bell System Technical Journal.

[8]  G. Masson Binomial Switching Networks for Concentration and Distribution , 1977, IEEE Trans. Commun..

[9]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .