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

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

Citing 4
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 symmetric or asymmetric 3-stage Clos networks under various routing strategies

Theoretical Computer Science

On the routing algorithms for optical multi-log2N networks

NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

Chang et al. showed that the number of middle switches required for WSNB under strategies: save the unused, packing, minimum index, cyclic dynamic, and cyclic static, for the 3-stage Clos network C(n, m, r) with r ≥ 3 is the same as required for SNB. In this paper, we prove the same conclusion for the multi-logd N network. We also extend our results, except for the minimum index strategy, to a general class of networks including the 3-stage Clos network and the multi-logd N network as special cases.