Broadcasting in hypercubes and star graphs with dynamic faults

Information Processing Letters

Volumn 66, Issue 6, 1998, Pages 321-326

  De Marco, Gianluca ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Broadcasting; Fault tolerance; Hypercube; Star graph

Indexed keywords

EID: 0006005422     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00074-x     Document Type: Article

References (27)

1. S.B. Akers, B. Krishnamurty, A group theoretic model for symmetric interconnection networks, IEEE Trans. Comput. 38 (4) (1989) 555-566.
2. S.B. Akers, B. Krishnamurty, The fault tolerance of star graphs, in: Proc. 2nd Internat. Conf. on Supercomputing, San Francisco, 1987, pp. 270-276.
3. S.B. Akers, B. Krishnamurty, On group graphs and their fault-tolerance, IEEE Trans. Comput. 36 (7) (1987) 885-888.
4. S.B. Akers, D. Harel, B. Krishnamurty, The star graph: an attractive alternative to the n-cube, in: Proc. Internat. Conf. on Parallel Processing, 1987, pp. 393-400.
5. S. Akl, K. Qiu, A novel routing scheme on the star and pancake networks and its applications, Parallel Comput. 19 (1993) 95-101.
6. S. Akl, K. Qiu, I. Stojmenovič, Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry, Networks 23 (1993) 215-225.
7. P. Berthome, A. Ferreira, S. Perennes, Decomposing hierarchical cayley graphs, with applications to information dissemination and algorithm design, in: Proc. Fifth IEEE Symp. on Parallel and Distributed Comput., 1993, pp. 720-723.
8. B.S. Cheblus, K. Diks, A. Pelc, Broadcasting in synchronous networks with dynamic faults, Networks, to appear.
9. K. Day, A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans. Parallel Distrib. Syst. 5 (1) (1994) 31-38.
10. M. Dietzfelbinger, S. Madhavapeddy, I.H. Sudborough, Three disjoint path paradigms in star networks, in: Third IEEE Symp. on Parallel and Distributed Comput., 1991, pp. 400-406.
11. P. Fragopoulou, S.G. Akl, Optimal communication algorithms on stars graphs using spanning tree constructions, J. Parallel Distrib. Comput. 24 (1995) 55-71.
12. P. Fragopoulou, S.G. Akl, Edge-disjoint spanning trees on the star network with applications to fault tolerance, IEEE Trans. Comput. 45 (1996).
13. P. Fraignaud, E. Lazard, Methods and problems of communication in usual networks, Discrete Appl. Math. 53 (1994) 79-134.
14. P. Fraignaud, C. Peyrat, Broadcasting in a hypercube when some calls fail, Inform. Process. Lett. 39 (1991) 115-119.
15. L. Gargano, A.L. Liestman, J. Peters, D. Richards, Reliable broadcasting, Discrete Appl. Math. 53 (1994) 135-148.
16. L. Gargano, A. Rescigno, U. Vaccaro, Fault-tolerant hypercube broadcasting via information dispersal, Networks 23 (1993) 271-282.
17. L. Gargano, U. Vaccaro, A. Vozella, Fault-tolerant routing in the star and pancake interconnection networks, Inform. Process. Lett. 45 (1993) 315-320.
18. L. Gargano, A. Rescigno, U. Vaccaro, Minimum time broadcast in faulty star networks, Discrete Appl. Math., to appear.
19. C. Gowrisankaran, Broadcasting in recursively decomposable cayley graphs, Discrete Appl. Math. 53 (1994) 171-182.
20. S.M. Hedetniemi, S.T. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988) 129-134.
21. J. Hromkovič, R. Klasing, B. Monien, R. Peine, Dissemination of information in interconnection networks (broadcasting and gossiping), in: D.-Z. Du and D.F. Hsu (Eds.), Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125-212.
22. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks 28 (1996) 143-156.
23. D. Peleg, A note on optimal time broadcast in faulty hypercubes, J. Parallel Distrib. Comput. 26 (1995) 132-135.
24. K. Qiu, H. Meijer, S.G. Akl, Decomposing a star graph into disjoint cycles, Inform. Process. Lett. 39 (1991) 125-129.
25. K. Qiu, S.G. Akl, I. Stojmenovič, Data communication and computational geometry on the star and pancake networks, in: 3rd IEEE Symposium on Parallel and Distributed Computing, TX, 1991.
26. Y. Saad, M.H. Schultz, Topological properties of the hypercube, IEEE Trans. Comput. 37 (1988) 867-882.
27. S. Sur, P.K. Srimani, Topological properties of the star graph, Comput. Math. Appl. 25 (1993) 87-98.