Nonblocking multirate distribution networks

The authors generalize known results for nonblocking distribution networks (also known as generalized connection networks) to the multirate environment, where different user connections share a switch's internal data paths in arbitrary functions of the total capacity. In particular, they derive conditions under which networks due to Y.P. Ofman (1965) and C.D. Thompson (1978), N. Pippenger (1973), and J.S. Turner (1989) lead to nonblocking multirate distribution networks. The results include both rearrangeable and wide-sense nonblocking networks. The complexity of most of our nonblocking multirate networks is roughly twice that of the corresponding space division networks. The one exception has complexity that exceeds that of the corresponding space division network by a log log factor.<<ETX>>

[1]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[2]  H. Suzuki,et al.  Output-buffer switch architecture for asynchronous transfer mode , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[3]  Jonathan S. Turner,et al.  Nonblocking networks for fast packet switching , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Thompson.  Generalized Connection Networks for Parallel Processor Intercommunication , 1978, IEEE Transactions on Computers.

[5]  Paul Feldman,et al.  Wide-Sense Nonblocking Networks , 1988, SIAM J. Discret. Math..

[6]  Clark D. Thomborson,et al.  Generalized Connection Networks for Parallel Processor Intercommunication , 1978, IEEE Trans. Computers.

[7]  Jonathan S. Turner,et al.  Nonblocking Multirate Networks , 1989, SIAM J. Comput..