A novel pairing algorithm for high-speed large-scale switches

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Wu, JSC	en_US
dc.contributor.author	Lin, YD	en_US
dc.date.accessioned	2014-12-08T15:45:55Z	-
dc.date.available	2014-12-08T15:45:55Z	-
dc.date.issued	2000-01-01	en_US
dc.identifier.issn	1089-7798	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/4234.823538	en_US
dc.identifier.uri	http://hdl.handle.net/11536/30874	-
dc.description.abstract	Motivated by the observation that switch throughput is mainly limited by the number of the maximum matching or pairing, instead of the head-of-line (HOL) effect, a pairing algorithm trying to maximize the number of pairing, for switches with K buffers in each input port is proposed. As shown in the related formula and simulation data, this algorithm performs well and can boost the switch throughput to 0.981 from traditional 0.632 when K = 4 even as the switch size --> infinity.	en_US
dc.language.iso	en_US	en_US
dc.subject	ATM switch	en_US
dc.subject	head-of-line	en_US
dc.subject	input queueing	en_US
dc.subject	matching	en_US
dc.subject	pairing	en_US
dc.title	A novel pairing algorithm for high-speed large-scale switches	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/4234.823538	en_US
dc.identifier.journal	IEEE COMMUNICATIONS LETTERS	en_US
dc.citation.volume	4	en_US
dc.citation.issue	1	en_US
dc.citation.spage	23	en_US
dc.citation.epage	25	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000085301100009	-
dc.citation.woscount	1	-
顯示於類別：	期刊論文

文件中的檔案：

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