DocumentCode
979234
Title
Broadcasting on incomplete hypercubes
Author
Tien, Jenn-Yang ; Ho, Ching-Tien ; Yang, Wei-Pang
Author_Institution
Chung Shan Inst. of Sci. & Technol., Lung-Tan, Taiwan
Volume
42
Issue
11
fYear
1993
fDate
11/1/1993 12:00:00 AM
Firstpage
1393
Lastpage
1398
Abstract
Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2n+2k nodes, where 0⩽k<n. The broadcasting algorithm is strictly optimal
Keywords
delays; hypercube networks; trees (mathematics); broadcasting algorithm; edge-disjoint spanning trees; faulty nodes; incomplete hypercube; Algorithm design and analysis; Bandwidth; Broadcasting; Costs; Flexible manufacturing systems; Hardware; Hypercubes; Routing; Topology; Tree graphs;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.247842
Filename
247842
Link To Document