Monotone routing in multirate rearrangeable clos networks

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Hu, XD	en_US
dc.contributor.author	Jia, XH	en_US
dc.contributor.author	Du, DZ	en_US
dc.contributor.author	Hwang, FK	en_US
dc.date.accessioned	2014-12-08T15:43:27Z	-
dc.date.available	2014-12-08T15:43:27Z	-
dc.date.issued	2001-09-01	en_US
dc.identifier.issn	0743-7315	en_US
dc.identifier.uri	http://dx.doi.org/10.1006/jpdc.2001.1755	en_US
dc.identifier.uri	http://hdl.handle.net/11536/29410	-
dc.description.abstract	In this paper, we study monotone routing ill the symmetric three-stage Clos network with general bandwidth, and propose a new approach to analyze the multirate rearrangeability. For networks with small size switches. we show that monotone routing is better than the previous methods. (C) 2001 Academic Press.	en_US
dc.language.iso	en_US	en_US
dc.title	Monotone routing in multirate rearrangeable clos networks	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1006/jpdc.2001.1755	en_US
dc.identifier.journal	JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING	en_US
dc.citation.volume	61	en_US
dc.citation.issue	9	en_US
dc.citation.spage	1382	en_US
dc.citation.epage	1388	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000171265700011	-
dc.citation.woscount	8	-
顯示於類別：	期刊論文

文件中的檔案：

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