Node-disjoint paths in hierarchical hypercube networks

  • Authors:

  • Ruei-Yu Wu;Gen-Huey Chen;Yu-Liang Kuo;Gerard J. Chang

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Taiwan University, Taipei 10617, Taiwan and Department of Management Information Systems, Hwa Hsia Institute of Technology, Tai ...;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 10617, Taiwan;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 10617, Taiwan;Department of Mathematics, National Taiwan University, Taipei 10617, Taiwan

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.08

Visualization

Abstract

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+2m+1,2^m^+^1+m+4}, where 2^m^+^1 is the diameter. The effectiveness of node-disjoint paths is further verified by experiments.