Abstract

In this paper, a method for constructing node-disjoint (parallel) paths in k-ary n-cube interconnection networks is described. We start by showing in general how to construct parallel paths in any Cartesian product of two graphs based on known paths in the factor graphs. Then we apply the general result to build a complete set of parallel paths (i.e., as many paths as the degree of the network) between any two nodes of a k-ary n-cube which can be viewed as the Cartesian product of complete graphs. Each of the constructed paths is of length at most 2 plus the minimum distance between the two nodes. These parallel paths are useful in speeding-up the transfer of large amounts of data between two nodes and in offering alternate routes in cases of faulty nodes.

Keywords

Publication details

DOI
10.24200/squjs.vol3iss0pp41-45
Journal
Sultan Qaboos University Journal for Science, 3, 41
Publisher
Sultan Qaboos University
Open access
Gold open access
License
CC BY 4.0

Cite this article

APA 7

Day, K., & Al-Ayyoub, A. E. (1997). Constructing Node-Disjoint Routes in K-Ary N-Cubes. Sultan Qaboos University Journal for Science, 3, 41. https://doi.org/10.24200/squjs.vol3iss0pp41-45

MLA 9

Day, Khaled, and Abdel Elah Al-Ayyoub. "Constructing Node-Disjoint Routes in K-Ary N-Cubes." Sultan Qaboos University Journal for Science, vol. 3, 1997, pp. 41. https://doi.org/10.24200/squjs.vol3iss0pp41-45.

Chicago (author–date)

Day, Khaled, and Abdel Elah Al-Ayyoub. 1997. "Constructing Node-Disjoint Routes in K-Ary N-Cubes." Sultan Qaboos University Journal for Science 3: 41. https://doi.org/10.24200/squjs.vol3iss0pp41-45.

Harvard

Day, K. and Al-Ayyoub, A. E. (1997) 'Constructing Node-Disjoint Routes in K-Ary N-Cubes', Sultan Qaboos University Journal for Science, 3, pp. 41. doi:10.24200/squjs.vol3iss0pp41-45.

Vancouver

Day K, Al-Ayyoub AE. Constructing Node-Disjoint Routes in K-Ary N-Cubes. Sultan Qaboos University Journal for Science. 1997;3:41. doi:10.24200/squjs.vol3iss0pp41-45

IEEE

K. Day, and A. E. Al-Ayyoub, "Constructing Node-Disjoint Routes in K-Ary N-Cubes," Sultan Qaboos University Journal for Science, vol. 3, pp. 41, 1997, doi: 10.24200/squjs.vol3iss0pp41-45.