Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Journal Article > Item 987654321/27404

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/27404

Title:	Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube
Authors:	Lin,Jen-Chih;Chi, Tzong-Heng;Keh, Huan-Chao;Liou, Ay-Hwa Andy
Contributors:	淡江大學資訊管理學系
Keywords:	Algorithms;Computer networks;Embedded systems;Fault tolerant computer systems;Trees (mathematics);Binary trees;Computer architecture
Date:	2001-06
Issue Date:	2013-06-13 11:28:14 (UTC+8)
Publisher:	Amsterdam: Elsevier BV * North-Holland
Abstract:	Although the embedding of complete binary trees in faulty hypercubes has received considerable attention, to our knowledge, no paper has demonstrated how to embed a complete binary tree in a faulty Flexible Hypercube. Therefore, this investigation presents an algorithm to facilitate the embedding job when the Flexible Hypercube contains faulty nodes. Of particular concern are the network structures of the Flexible Hypercube that balance the load before as well as after faults start to degrade the performance of the Flexible Hypercube. Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n−2) faults can be tolerated with congestion 1, dilation 4 and load 1.
Relation:	Journal of Systems Architecture 47(7), pp.543-548
DOI:	10.1016/S1383-7621(01)00004-2
Appears in Collections:	[Graduate Institute & Department of Information Management] Journal Article

Files in This Item:

File	Size	Format
1383-7621_47(7)p543-548.pdf	70Kb	Adobe PDF	266	View/Open
Embedding of complete binary tree with 2-expansion in a faulty Flexible Hypercube.pdf	70Kb	Adobe PDF	1	View/Open
index.html	0Kb	HTML	65	View/Open