Choosing the best log(k)(N,m,P) strictly nonblocking networks

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Hwang, FK	en_US
dc.date.accessioned	2014-12-08T15:49:11Z	-
dc.date.available	2014-12-08T15:49:11Z	-
dc.date.issued	1998-04-01	en_US
dc.identifier.issn	0090-6778	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/26.664299	en_US
dc.identifier.uri	http://hdl.handle.net/11536/32684	-
dc.description.abstract	We extend the log(2) (N, m, P) network proposed by Shyy and Lea to base k. We give a unifying proof (instead of three separate cases as done by Shyy and Lea) for the condition of being strictly nonblocking, and a simpler expression of the result. We compare the number of crosspoints for log(k) (n, m, p) over various k.	en_US
dc.language.iso	en_US	en_US
dc.subject	Banyan network	en_US
dc.subject	Clos network	en_US
dc.subject	strictly nonblocking network	en_US
dc.title	Choosing the best log(k)(N,m,P) strictly nonblocking networks	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/26.664299	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON COMMUNICATIONS	en_US
dc.citation.volume	46	en_US
dc.citation.issue	4	en_US
dc.citation.spage	454	en_US
dc.citation.epage	455	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000073175600010	-
dc.citation.woscount	19	-
顯示於類別：	期刊論文

文件中的檔案：

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