This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
June 2012 (vol. 23 no. 6)
pp. 1129-1134
ASCII Text
x 
 
Cheng-Nan Lai, "Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 6, pp. 1129-1134, June, 2012.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2011.261,
author = {Cheng-Nan Lai},
title = {Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {23},
number = {6},
issn = {1045-9219},
year = {2012},
pages = {1129-1134},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.261},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
IS - 6
SN - 1045-9219
SP1129
EP1134
EPD - 1129-1134
A1 - Cheng-Nan Lai,
PY - 2012
KW - Hypercube
KW - node-disjoint paths
KW - matching
KW - optimization problem.
VL - 23
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Cheng-Nan Lai, National Kaohsiung Marine University, Kaohsiung
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths from one source node to other m (not necessarily distinct) destination nodes are constructed in an n-dimensional hypercube, provided the existence of such node-disjoint shortest paths which can be verified in O(mn^{1.5}) time, where {m} \leq {n}. The construction procedure has worst case time complexity O(mn), which is optimal and hence improves previous results. By taking advantages of the construction procedure, m node-disjoint paths from one source node to other m (not necessarily distinct) destination nodes in an n-dimensional hypercube such that their total length is minimized can be constructed in O(mn^{1.5} + {m}^3{n}) time, which is more efficient than the previous result of O(m^2 {n}^{2.5} + {mn}^3) time. Besides, their maximal length is also minimized in the worst case.

[1] B. Bollobás, Extremal Graph Theory. Academic Press, 1978.
[2] J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Elsevier, 1976.
[3] 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.
[4] X.B. Chen, "Many-to-Many Disjoint Paths in Faulty Hypercubes," Information Sciences, vol. 179, no. 18, pp. 3110-3115, 2009.
[5] E. Cheng, S. Gao, K. Qiu, and Z. Shen, "On Disjoint Shortest Paths Routing on the Hypercube," Proc. Third Ann. Int'l Conf. Combinatorial Optimization and Applications (COCOA '09), pp. 375-383, 2009.
[6] K. Day and A.E. Al-Ayyoub, "Fault Diameter of $k$ -ary $n$ -cube Networks," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 903-907, Sept. 1997.
[7] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three Disjoint Path Paradigms in Star Networks," Proc. IEEE Third Symp. Parallel and Distributed Processing, pp. 400-406, 1991.
[8] D.R. Duh and G.H. Chen, "On the Rabin Number Problem," Networks, vol. 30, no. 3, pp. 219-230, 1997.
[9] D.R. Duh, G.H. Chen, and D.F. Hsu, "Combinatorial Properties of Generalized Hypercube Graphs," Information Processing Letters, vol. 57, no. 1, pp. 41-45, 1996.
[10] 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, Jan. 1991.
[11] J.S. Fu, "Longest Fault-Free Paths in Hypercubes with Vertex Faults," Information Science, vol. 176, pp. 759-771, 2006.
[12] Z. Galil, "Efficient Algorithms for Finding Maximum Matching in Graphs," ACM Computing Surveys, vol. 18, no. 1, pp. 23-38, 1986.
[13] 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.
[14] T.F. Gonzalez and D. Serena, "$n$ -Cube Network: Node Disjoint Shortest Paths for Maximal Distance Pairs of Vertices," Parallel Computing, vol. 30, no. 8, pp. 973-998, 2004.
[15] Q.P. Gu and S. Peng, "An Efficient Algorithm for the $k$ -Pairwise Disjoint Paths Problem in Hypercubes," J. Parallel and Distributed Computing, vol. 60, pp. 764-774, 2000.
[16] 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.
[17] Q.P. Gu and S. Peng, "Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes," Parallel Computing, vol. 24, pp. 1245-1261, 1998.
[18] S.Y. Hsieh and N.W. Chang, "Extended Fault-Tolerant Cycle Embedding in Faulty Hypercubes," IEEE Trans. Reliability, vol. 58, no. 4, pp. 702-710, Dec. 2009.
[19] S.Y. Hsieh and Y.F. Weng, "Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults," Theory of Computing Systems, vol. 45, no. 2, pp. 407-425, 2009.
[20] D.F. Hsu, "On Container Width and Length in Graphs, Groups, and Networks," IEICE Trans. Fundamentals of Electronics, Comm. and Computer Science, vol. E77-A, no. 4, pp. 668-680, 1994.
[21] C.N. Lai, "One-to-Many Disjoint Paths in the Hypercube and Folded Hypercube," PhD thesis, Dept. of Computer Science and Information Eng., Nat'l Taiwan Univ., 2001.
[22] C.N. Lai, G.H. Chen, and D.R. Duh, "Constructing One-to-Many Disjoint Paths in Folded Hypercubes," IEEE Trans. Computers, vol. 51, no. 1, pp. 33-45, Jan. 2002.
[23] C.N. Lai and G.H. Chen, "$w$ -Rabin Numbers and Strong $w$ -Rabin Numbers of Folded Hypercubes," Networks, vol. 51, no. 3, pp. 171-177, 2008.
[24] S. Latifi, H. Ko, and P.K. Srimani, "Node-to-Set Vertex Disjoint Paths in Hypercube Networks," Technical Report CS-98-107, Colorado State Univ., 1998.
[25] S.C. Liaw and G.J. Chang, "Generalized Diameters and Rabin Numbers of Networks," J. Combinatorial Optimization, vol. 4, pp. 371-384, 1999.
[26] K. Qiu, "An Efficient Disjoint Shortest Paths Routing Algorithm for the Hypercube," Proc. IEEE 14th Int'l Conf. Parallel and Distributed Systems (ICPADS '08), pp. 43-47, 2008.
[27] M.O. Rabin, "Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance," J. ACM, vol. 36, no. 2, pp. 335-348, 1989.
[28] Y. Saad and M.H. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[29] D. Wang, "A Low-Cost Fault-Tolerant Structure for the Hypercube," J. Supercomputing, vol. 20, no. 3, pp. 203-216, 2001.
[30] R.Y. Wu, G.H. Chen, Y.L. Kuo, and G.J. Chang, "Node-Disjoint Paths in Hierarchical Hypercube Networks," Information Sciences, vol. 177, no. 19, pp. 4200-4207, 2007.

Index Terms:
Hypercube, node-disjoint paths, matching, optimization problem.
Citation:
Cheng-Nan Lai, "Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 6, pp. 1129-1134, June 2012, doi:10.1109/TPDS.2011.261
Usage of this product signifies your acceptance of the Terms of Use.