Cluster fault-tolerant routing in star graphs

Networks

Volumn 35, Issue 1, 2000, Pages 83-90

  Gu, Qian Ping ^a   Peng, Shietung ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

Fault tolerant routing; Interconnection network; Node disjoint paths

Indexed keywords

EID: 0033634463     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(200001)35:1<83::AID-NET7>3.0.CO;2-D     Document Type: Article

References (28)

1. [1] S.B. Akers and B. Krishnamurthy, A group theoretic model for symmetric interconnection networks, IEEE Trans Comput 38 (1989), 555-566.
2. [2] S.G. Akl and K. Qiu, Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry, Networks 23 (1993), 215-225.
3. [3] J.C. Bermond, Interconnection networks, Discr Appl Math [Special issue (edited)] (1992).
4. [4] J.C. Bermond, N. Homobono, and C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin 5 (1989).
5. [5] K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans Parallel Distrib Syst 5 (1994), 31-38.
6. [6] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, "Three disjoint path paradigms in star networks," Proc IEEE Symp Parallel and Distributed Processing, 1991, pp. 400-406.
7. [7] A.H. Esfahanian, Generalized measures of fault tolerance with application to n-cube networks, IEEE Trans Comput 38 (1989), 1586-1591.
8. [8] F. Fragopoulou and S.G. Akl, A parallel algorithm for computing fourier transforms on the star graph, IEEE Trans Parallel Distrib Syst 5 (1994), 100-106.
9. [9] F. Fragopoulou and S.G. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, J Parallel Distrib Comput 24 (1995), 55-71.
10. [10] M.R. Garey and D.S. Johnson, Computers and intractability, A guide to the theory of NP-completeness, Freeman, New York, 1979.
11. [11] Q. Gu and S. Peng, Efficient algorithms for disjoint paths in star graphs, Proc 6th Transputer/Occam Int Conf, 1994, pp. 53-65.
12. [12] Q. Gu and S. Peng, Node-to-node cluster fault tolerant routing in star graphs, Inf Process Lett 56 (1995), 29-35.
13. [13] Q. Gu and S. Peng, k-pairwise cluster fault tolerant routing in hypercubes, IEEE Trans Comput 46 (1997), 1042-1049.
14. [14] Q. Gu and S. Peng, Node-to-set disjoint paths problem in star graphs, Inf Process Lett 62 (1997), 201-207.
15. [15] D.F. Hsu, Interconnection networks and algorithms, Networks (special issue) 23(4) (1993).
16. [16] D.F. Hsu, On container with width and length in graphs, groups, and networks, IEICE Trans Fundam Elect Inf Comput Sci E77-A(4) (1994), 668-680.
17. [17] Z. Jovanovic and J. Misic, Fault tolerance of the star graph interconnection network, Inf Process Lett 49 (1994), 145-150.
18. [18] R.M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975), 45-68.
19. [19] S. Latifi, On the fault-diameter of the star graph, Inf Process Lett 46 (1993), 143-150.
20. [20] S. Latifi, M. Hedge, and M. Naraghi-Pour, Conditional connectivity measures for large multi-processor systems, IEEE Trans Comput 43 (1994), 218-222.
21. [21] J.F. Lynch, The equivalence of theorem proving and the interconnection problem, ACM SIGDA Newsl 5 (1975), 3.
22. [22] S. Madhavapeddy and I.H. Sudborough, "A topological property of hypercubes: Node disjoint paths." Proc 2nd IEEE Symp on Parallel and Distributed Processing, 1990, pp. 532-539.
23. [23] J. McHugh, Algorithmic graph theory, Prentice-Hall, Englewood Cliffs, NJ, 1990.
24. [24] M.A. Rabin, Efficient dispersal of information for security load balancing, and fault tolerance, J ACM 36 (1989), 335-348.
25. [25] Y. Rouskov and P.K. Srimani, Fault diameter of star graphs Inf Process Lett 48 (1993), 234-251.
26. [26] Y. Shiloach, The two paths problem is polynomial, Technical Report STAN-CS-78-654, Stanford University, 1978.
27. [27] S.B. Tien and C.S. Raghavendra, Algorithms and bounds for shortest paths and diameter in faulty hypercubes, IEEE Trans Parallel Distrib Syst 4 (1993), 713-718.
28. [28] M. Watkin, On the existence of certain disjoint arcs in graphs, Duke Math J (1968).