Efficient path-based multicast in wormhole-routed mesh networks

doi:10.1016/S1383-7621(99)00049-1

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/59901

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/59901

題名:	Efficient path-based multicast in wormhole-routed mesh networks
作者:	Chen, Tzung-Shi;Chang, Chih-yung;Sheu, Jang-Ping
貢獻者:	淡江大學資訊工程學系
關鍵詞:	Interconnection networks;Mesh networks;Multicast;Wormhole routing;Parallel computing
日期:	2000-07
上傳時間:	2011-10-05 22:25:20 (UTC+8)
出版者:	Amsterdam: Elsevier BV * North-Holland
摘要:	The capability of multidestination wormhole allows a message to be propagated along any valid path in a wormhole-routed network conforming to the underlying base routing scheme. The multicast on the path-based routing model is highly dependent on the spatial locality of destinations participating in multicasting. In this paper, we propose two proximity grouping schemes for efficient multicast in wormhole-routed mesh networks with multidestination capability by exploiting the spatial locality of the destination set. The first grouping scheme, graph-based proximity grouping, is proposed to group the destinations together with locality to construct several disjoint sub-meshes. This is achieved by modeling the proximity grouping problem to graph partitioning problem. The second one, pattern-based proximity grouping, is proposed by the pattern classification schemes to achieve the goal of the proximity grouping. By simulation results, we show the routing performance gains over the traditional Hamiltonian-path routing scheme.
關聯:	Journal of systems architecture 46(10), pp.919-930
DOI:	10.1016/S1383-7621(99)00049-1
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	282	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....