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-logdN 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-logdN network as special cases.
Original language | English |
---|---|
Pages (from-to) | 232-239 |
Number of pages | 8 |
Journal | Theoretical Computer Science |
Volume | 352 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 2006 Mar 7 |
Fingerprint
ASJC Scopus subject areas
- Computational Theory and Mathematics
Cite this
Wide-sense nonblocking for multi-logdN networks under various routing strategies. / Chang, F. H.; Guo, Jun-Yi; Hwang, F. K.
In: Theoretical Computer Science, Vol. 352, No. 1-3, 07.03.2006, p. 232-239.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Wide-sense nonblocking for multi-logdN networks under various routing strategies
AU - Chang, F. H.
AU - Guo, Jun-Yi
AU - Hwang, F. K.
PY - 2006/3/7
Y1 - 2006/3/7
N2 - 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-logdN 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-logdN network as special cases.
AB - 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-logdN 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-logdN network as special cases.
UR - http://www.scopus.com/inward/record.url?scp=32644447822&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=32644447822&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2005.10.048
DO - 10.1016/j.tcs.2005.10.048
M3 - Article
AN - SCOPUS:32644447822
VL - 352
SP - 232
EP - 239
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - 1-3
ER -