Wide-sense nonblocking for multi-log(d) N networks under various routing strategies
| dc.citation.epage | 239 | en_US |
| dc.citation.issue | 1-3 | en_US |
| dc.citation.spage | 232 | en_US |
| dc.citation.volume | 352 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | Chang, FH | en_US |
| dc.contributor.author | Guo, JY | en_US |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:17:06Z | |
| dc.date.available | 2014-12-08T15:17:06Z | |
| dc.date.issued | 2006-03-07 | en_US |
| dc.description.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-log(d) 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-log(d) N network as special cases. (c) 2005 Elsevier B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.tcs.2005.10.048 | en_US |
| dc.identifier.issn | 0304-3975 | en_US |
| dc.identifier.journal | THEORETICAL COMPUTER SCIENCE | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.tcs.2005.10.048 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/12495 | |
| dc.identifier.wosnumber | WOS:000235826900017 | |
| dc.language.iso | en_US | en_US |
| dc.title | Wide-sense nonblocking for multi-log(d) N networks under various routing strategies | en_US |
| dc.type | Article | en_US |