完整後設資料紀錄
DC 欄位語言
dc.contributor.authorTsai, KHen_US
dc.contributor.authorWang, DWen_US
dc.contributor.authorHwang, Fen_US
dc.date.accessioned2014-12-08T15:43:44Z-
dc.date.available2014-12-08T15:43:44Z-
dc.date.issued2001-06-28en_US
dc.identifier.issn0304-3975en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0304-3975(00)00147-Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/29562-
dc.description.abstractThe 3-stage Clos network is generally considered the most basic multistage interconnecting network (MIN). The nonblocking property of such network has been extensively studied in the past. However, there are only a few lower bound results regarding wide-sense nonblocking. We show that in the classical circuit switching environment, to guarantee wide-sense nonblocking for large r, 2n - 1 center switches are necessary, where I is the number of input switches and n is the number of inlets of each input switch. For the multirate environment, we show that for large r, any 3-stage Clos network needs atleast 3n - 2 center switches to guarantee wide-sense nonblocking. Our proof works even for the two-rate environment. (C) 2001 Elsevier Science B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.titleLower bounds for wide-sense nonblocking Clos networken_US
dc.typeArticle; Proceedings Paperen_US
dc.identifier.doi10.1016/S0304-3975(00)00147-Xen_US
dc.identifier.journalTHEORETICAL COMPUTER SCIENCEen_US
dc.citation.volume261en_US
dc.citation.issue2en_US
dc.citation.spage323en_US
dc.citation.epage328en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000169541100009-
顯示於類別:會議論文


文件中的檔案:

  1. 000169541100009.pdf

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