
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
ChengNan Lai, GenHuey Chen, DyiRong Duh, "Constructing OnetoMany Disjoint Paths in Folded Hypercubes," IEEE Transactions on Computers, vol. 51, no. 1, pp. 3345, January, 2002.  
BibTex  x  
@article{ 10.1109/12.980015, author = {ChengNan Lai and GenHuey Chen and DyiRong Duh}, title = {Constructing OnetoMany Disjoint Paths in Folded Hypercubes}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {1}, issn = {00189340}, year = {2002}, pages = {3345}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.980015}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Constructing OnetoMany Disjoint Paths in Folded Hypercubes IS  1 SN  00189340 SP33 EP45 EPD  3345 A1  ChengNan Lai, A1  GenHuey Chen, A1  DyiRong Duh, PY  2002 KW  Disjoint paths KW  folded hypercube KW  hypercube KW  optimization problem KW  Rabin number. VL  51 JA  IEEE Transactions on Computers ER   
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 kdimensional 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 byproduct, 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: NorthHolland, 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. 8893, Jan. 1999.
[4] C.C. Chen and J. Chen, “Nearly Optimal OnetoMany Parallel Routing in Star Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 11961202, 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. 3138, 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. 400406, 1991.
[7] D.R. Duh and G.H. Chen, “Topological Properties of WKRecursive Networks,” J. Parallel and Distributed Computing, vol. 23, pp. 468474, 1994.
[8] D.R. Duh and G.H. Chen, “On the Rabin Number Problem,” Networks, vol. 30, no. 3, pp. 219230, 1997.
[9] A. ElAmawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 3142, 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. 291301, 1998.
[11] Q.P. Gu and S. Peng, “kPairwise Cluster Fault Tolerant Routing in Hypercubes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 10421049, Sept. 1997.
[12] Q.P. Gu and S. Peng, “Cluster FaultTolerant Routing in Star Graphs,” Networks, vol. 35, no. 1, pp. 8390, 2000.
[13] D.F. Hsu, “On Container Width and Length in Graphs, Groups, and Networks,” IEICE Trans. Fundamentals of Electronics, vol. E77A, no. 4, pp. 668680, 1994.
[14] D.F. Hsu and Y.D. Lyuu, “A GraphTheoretical Study of Transmission Delay and Fault Tolerance,” Int'l J. Mini and Microcomputers, vol. 16, no. 1, pp. 3542, 1994.
[15] C.N. Lai, “OnetoMany 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 OnetoMany Disjoint Paths,” Technical Report NTUCSIE 0002, Dept. of Computer Science and Information Eng., National Taiwan Univ., Taipei (also available atwww.cs.cornell.edu/home/weichen/research/ mypapers/thesis.ps.gzhttp://www.csie.ntu.edu.tw ~ghchen), 2000.
[17] S.C. Liaw and G.J. Chang, “Generalized Diameters and Rabin Numbers of Networks,” J. Combinatorial Optimization, vol. 4, pp. 371384, 1999.
[18] S.C. Liaw, G.J. Chang, F. Cao, and D.F. Hsu, “FaultTolerant Routing in Circulant Networks and Cycle Prefix Networks,” Annals of Combinatorics, vol. 2, pp. 165172, 1998.
[19] M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance J. ACM, vol. 36, no. 2, pp. 335348, 1989.
[20] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.