Node-disjoint paths in hierarchical hypercube networks

The hierarchical hypercube network is suitable for massively parallel systems. One of its appealing properties is the low number of connections per processor, which can facilitate the VLSI design and fabrication. Other alluring features include symmetry and logarithmic diameter, which can derive eas...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2007-10, Vol.177 (19), p.4200-4207
Main Authors: Wu, Ruei-Yu, Chen, Gen-Huey, Kuo, Yu-Liang, Chang, Gerard J.
Format: Article
Language:English
Subjects:
Container
Hierarchical hypercube network
Hypercube
Interconnection network
Node-disjoint paths
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The hierarchical hypercube network is suitable for massively parallel systems. One of its appealing properties is the low number of connections per processor, which can facilitate the VLSI design and fabrication. Other alluring features include symmetry and logarithmic diameter, which can derive easy and fast algorithms for communication. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the hierarchical hypercube network. Their maximal length is not greater than max { 2 m + 1 + 2 m + 1 , 2 m + 1 + m + 4 } , where 2 m + 1 is the diameter. The effectiveness of node-disjoint paths is further verified by experiments.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2007.02.035