This Article 
 Bibliographic References 
 Add to: 
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
January 2002 (vol. 51 no. 1)
pp. 33-45

Routing functions have been shown effective in deriving disjoint paths in the hypercube. In this paper, using a minimal routing function, disjoint paths from one node to another distinct nodes are constructed in a k-dimensional folded hypercube whose maximal length is not greater than the diameter plus one, which is minimum in the worst case. For the general case, the maximal length is nearly optimal (the maximal distance between the two end nodes of these paths plus two). As a by-product, the Rabin number of the folded hypercube is obtained, which is an open problem raised by Liaw and Chang.

[1] B. Bollobás, Extremal Graph Theory. London: Academic Press, 1978.
[2] J.A. Bondy and U.S.R. Murthy, Graph Theory with Applications. New York: North-Holland, 1976.
[3] F. Cao, D.Z. Du, D.F. Hsu, and S.H. Teng, “Fault Tolerance Properties of Pyramid Networks,” IEEE Trans. Computers, vol. 48, no. 1, pp. 88-93, Jan. 1999.
[4] C.C. Chen and J. Chen, “Nearly Optimal One-to-Many Parallel Routing in Star Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1196-1202, Dec. 1997.
[5] K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 31-38, Jan. 1994.
[6] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three disjoint path paradigms in star networks," Proc. Third IEEE Symp. Parallel and Distributed Processing, pp. 400-406, 1991.
[7] D.R. Duh and G.H. Chen, “Topological Properties of WK-Recursive Networks,” J. Parallel and Distributed Computing, vol. 23, pp. 468-474, 1994.
[8] D.R. Duh and G.H. Chen, “On the Rabin Number Problem,” Networks, vol. 30, no. 3, pp. 219-230, 1997.
[9] A. El-Amawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.
[10] S. Gao, B. Novick, and K. Qiu, “From Hall's Matching Theorem to Optimal Routing on Hypercubes,” J. Combinatorial Theory, Series B, vol. 74, pp. 291-301, 1998.
[11] Q.P. Gu and S. Peng, “k-Pairwise Cluster Fault Tolerant Routing in Hypercubes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 1042-1049, Sept. 1997.
[12] Q.P. Gu and S. Peng, “Cluster Fault-Tolerant Routing in Star Graphs,” Networks, vol. 35, no. 1, pp. 83-90, 2000.
[13] D.F. Hsu, “On Container Width and Length in Graphs, Groups, and Networks,” IEICE Trans. Fundamentals of Electronics, vol. E77-A, no. 4, pp. 668-680, 1994.
[14] D.F. Hsu and Y.D. Lyuu, “A Graph-Theoretical Study of Transmission Delay and Fault Tolerance,” Int'l J. Mini and Microcomputers, vol. 16, no. 1, pp. 35-42, 1994.
[15] C.N. Lai, “One-to-Many Disjoint Paths in the Hypercube and Folded Hypercube,” PhD thesis, Dept. of Computer Science and Information Eng., National Taiwan Univ., Taipei, June 2001.
[16] C.N. Lai, G.H. Chen, and D.R. Duh, “Routing Functions—An Effective Approach to Deriving One-to-Many Disjoint Paths,” Technical Report NTUCSIE 00-02, Dept. of Computer Science and Information Eng., National Taiwan Univ., Taipei (also available mypapers/ ~ghchen), 2000.
[17] S.C. Liaw and G.J. Chang, “Generalized Diameters and Rabin Numbers of Networks,” J. Combinatorial Optimization, vol. 4, pp. 371-384, 1999.
[18] S.C. Liaw, G.J. Chang, F. Cao, and D.F. Hsu, “Fault-Tolerant Routing in Circulant Networks and Cycle Prefix Networks,” Annals of Combinatorics, vol. 2, pp. 165-172, 1998.
[19] M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance J. ACM, vol. 36, no. 2, pp. 335-348, 1989.
[20] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.

Index Terms:
Disjoint paths, folded hypercube, hypercube, optimization problem, Rabin number.
Cheng-Nan Lai, Gen-Huey Chen, Dyi-Rong Duh, "Constructing One-to-Many Disjoint Paths in Folded Hypercubes," IEEE Transactions on Computers, vol. 51, no. 1, pp. 33-45, Jan. 2002, doi:10.1109/12.980015
Usage of this product signifies your acceptance of the Terms of Use.