Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, FHen_US
dc.contributor.authorGuo, JYen_US
dc.contributor.authorHwang, FKen_US
dc.date.accessioned2014-12-08T15:17:06Z-
dc.date.available2014-12-08T15:17:06Z-
dc.date.issued2006-03-07en_US
dc.identifier.issn0304-3975en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.tcs.2005.10.048en_US
dc.identifier.urihttp://hdl.handle.net/11536/12495-
dc.description.abstractChang 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.language.isoen_USen_US
dc.titleWide-sense nonblocking for multi-log(d) N networks under various routing strategiesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.tcs.2005.10.048en_US
dc.identifier.journalTHEORETICAL COMPUTER SCIENCEen_US
dc.citation.volume352en_US
dc.citation.issue1-3en_US
dc.citation.spage232en_US
dc.citation.epage239en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000235826900017-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. 000235826900017.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.