On 3-stage Clos networks with different nonblocking requirements on two types of calls

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Hwang, FK	en_US
dc.date.accessioned	2014-12-08T15:19:16Z	-
dc.date.available	2014-12-08T15:19:16Z	-
dc.date.issued	2005-05-01	en_US
dc.identifier.issn	1382-6905	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/s10878-005-1410-y	en_US
dc.identifier.uri	http://hdl.handle.net/11536/13781	-
dc.description.abstract	Hwang and Lin introduced a new nonblocking requirement for 2-cast traffic which imposes different requirements on different types of coexisting calls. The requirement is strictly nonblocking for point-to-point calls among the 2-cast traffic, and is rearrangeable for genuine 2-cast calls. They conjectured that the 3-stage Clos network C(n, n, r, r, 2n) satisfies the above requirement.	en_US
dc.language.iso	en_US	en_US
dc.subject	3-stage Clos networks	en_US
dc.subject	nonblocking networks	en_US
dc.subject	rearrangeable networks	en_US
dc.title	On 3-stage Clos networks with different nonblocking requirements on two types of calls	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1007/s10878-005-1410-y	en_US
dc.identifier.journal	JOURNAL OF COMBINATORIAL OPTIMIZATION	en_US
dc.citation.volume	9	en_US
dc.citation.issue	3	en_US
dc.citation.spage	263	en_US
dc.citation.epage	266	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000230175400002	-
dc.citation.woscount	0	-
顯示於類別：	期刊論文

文件中的檔案：

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