Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies

Authors:
F. H. Chang;J. Y. Guo;F. K. Hwang;C. K. Lin
Affiliations:
Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan 30050, ROC;Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan 30050, ROC;Department of Applied Mathematics, National Chiaotung University, Hsinchu, Taiwan 30050, ROC;Department of Applied Mathematics, National Central University, Chungli, Taiwan, ROC
Venue:
Theoretical Computer Science
Year:
2004

Citing 3
Cited 1

Wide-Sense Nonblocking Clos Networks Under Packing Strategy

IEEE Transactions on Computers
Lower bounds for wide-sense nonblocking Clos network

Theoretical Computer Science
The Mathematical Theory of Nonblocking Switching Networks

The Mathematical Theory of Nonblocking Switching Networks

Wide-sense nonblocking for multi-logd N networks under various routing strategies

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Benes established the notion of wide-sense nonblocking by constructing an example on the symmetric 3-stage Clos network under packing which requires less hardware compared to strict nonblocking. This has remained the only example of a wide-sense non-blocking 3-stage Clos network which is not strictly nonblocking. In this paper, we study packing as well as several other routing strategies which have been studied in the literature and proved that no other example exists for the symmetric 3-stage Clos network. We then extend the study to asymmetric 3-stage Clos network for the first time. In particular, we extend Benes example to asymmetric 3-stage Clos network and show that these are the only two possible examples for the strategies under study.