完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hwang, FK | en_US |
dc.date.accessioned | 2014-12-08T15:18:29Z | - |
dc.date.available | 2014-12-08T15:18:29Z | - |
dc.date.issued | 2005-09-01 | en_US |
dc.identifier.issn | 0090-6778 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/TCOMM.2005.852839 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/13296 | - |
dc.description.abstract | The 3-stage Clos network is the most-studied switching network. However, exact conditions on the strictly nonblocking multicast three-stage Clos network under various models are difficult to get, due to the messy detail and because each case employs a different argument. Hwang and Liaw made the latest attempt and pointed out errors in previous attempts. However, they made errors, too. In this paper, we propose a unifying approach to study those models systematically (which also applies to some wide-sense nonblocking (WSNB) networks). We also propose a new routing algorithm, and use the unifying approach to derive a necessary and sufficient condition for WSNB. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | 3-stage Clos network | en_US |
dc.subject | strictly nonblocking | en_US |
dc.subject | switching network | en_US |
dc.subject | wide-sense nonblocking (WSNB) switching network | en_US |
dc.subject | window algorithm | en_US |
dc.title | A unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networks | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/TCOMM.2005.852839 | en_US |
dc.identifier.journal | IEEE TRANSACTIONS ON COMMUNICATIONS | en_US |
dc.citation.volume | 53 | en_US |
dc.citation.issue | 9 | en_US |
dc.citation.spage | 1581 | en_US |
dc.citation.epage | 1586 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
dc.identifier.wosnumber | WOS:000231970100021 | - |
dc.citation.woscount | 8 | - |
顯示於類別: | 期刊論文 |