
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
QianPing Gu, Shietung Peng, "kPairwise Cluster Fault Tolerant Routing in Hypercubes," IEEE Transactions on Computers, vol. 46, no. 9, pp. 10421049, September, 1997.  
BibTex  x  
@article{ 10.1109/12.620486, author = {QianPing Gu and Shietung Peng}, title = {kPairwise Cluster Fault Tolerant Routing in Hypercubes}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {9}, issn = {00189340}, year = {1997}, pages = {10421049}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.620486}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  kPairwise Cluster Fault Tolerant Routing in Hypercubes IS  9 SN  00189340 SP1042 EP1049 EPD  10421049 A1  QianPing Gu, A1  Shietung Peng, PY  1997 KW  Interconnection networks KW  algorithms KW  nodedisjoint paths KW  node fault tolerant routing. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—In this paper, we introduce a general fault tolerant routing problem,
[1] J.C. Bermond, "Interconnection Networks," Discrete Applied Math, special issue, 1992.
[2] A.H. Esfahanian, “Generalized Measures of Fault Tolerance with Application to nCube Networks,” IEEE Trans. Computers, vol. 38, no. 11, pp. 1,5861,591, 1989.
[3] Q. Gu and S. Peng, "An Efficient Algorithm for NodetoNode Routing in Hypercubes with Faulty Clusters," Computer J., vol. 39, no. 1, pp. 1419, 1996.
[4] D.F. Hsu, "Interconnection Networks and Algorithms," Networks, special issue, vol. 23, no. 4, 1993.
[5] D.F. Hsu, "On Container With Width and Length in Graphs, Groups, and Networks," IEICE Trans. Fundamental of Electronics, Information, and Computer Sciences, vol. E77A, no. 4, pp. 668680, 1994.
[6] D.F. Hsu and Y.O. Lyuu, "A Graph Theoretical Study of Transmission Delay and Fault Tolerance," Proc. Fourth ISMM Int'l Conf. Parallel and Distributed Computing and Systems, pp. 2024, 1991.
[7] R.M. Karp, "On the Computational Complexity of Combinational Problems," Networks, vol. 5, pp. 4568, 1975.
[8] S. Latifi, “Combinatorial Analysis of the Fault Diameter of the$n$Cube,” IEEE Trans. Computers, vol. 42, no.1, pp. 2733, 1993.
[9] S. Madhavapeddy and I.H. Sudborough, "A Topological Property of Hypercubes: Node Disjoint Paths," Proc. Second IEEE Symp. Parallel and Distributed Processing, pp. 532539, 1990.
[10] J. McHugh, Algorithmic Graph Theory. Prentice Hall, 1990.
[11] M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance J. ACM, vol. 36, no. 2, pp. 335348, 1989.
[12] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867872, July 1988.
[13] C. L. Seitz,“The cosmic cube,”CACM, vol. 28, pp. 22–33, Jan. 1985.
[14] Y. Shiloach, "The Two Paths Problem Is Polynomial," Technical Report STANCS78654, Stanford Univ., 1978.
[15] S.B. Tien and C.S. Raghavendra,“Algorithms and bounds for shortest paths and diameter in faultyhypercubes,” IEEE Trans. Parallel and Distributed Systems, pp. 713718, June 1993.
[16] M. Watkin, "On the Existence of Certain Disjoint Arcs in Graphs," Duke Math. J., 1968.