完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHwang, FKen_US
dc.date.accessioned2014-12-08T15:18:29Z-
dc.date.available2014-12-08T15:18:29Z-
dc.date.issued2005-09-01en_US
dc.identifier.issn0090-6778en_US
dc.identifier.urihttp://dx.doi.org/10.1109/TCOMM.2005.852839en_US
dc.identifier.urihttp://hdl.handle.net/11536/13296-
dc.description.abstractThe 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.isoen_USen_US
dc.subject3-stage Clos networken_US
dc.subjectstrictly nonblockingen_US
dc.subjectswitching networken_US
dc.subjectwide-sense nonblocking (WSNB) switching networken_US
dc.subjectwindow algorithmen_US
dc.titleA unifying approach to determine the necessary and sufficient conditions for nonblocking multicast 3-stage Clos networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TCOMM.2005.852839en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMMUNICATIONSen_US
dc.citation.volume53en_US
dc.citation.issue9en_US
dc.citation.spage1581en_US
dc.citation.epage1586en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000231970100021-
dc.citation.woscount8-
顯示於類別:期刊論文


文件中的檔案:

  1. 000231970100021.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。