#### DMCA

## Reliable Broadcasting (1994)

Venue: | Disc. Appl. Math |

Citations: | 4 - 2 self |

### Citations

286 |
A group-theoretic model for symmetric interconnection networks,
- Akers, Krishnamurthy
- 1989
(Show Context)
Citation Context ...eems to be difficult to verify whether or not a given graph is kreliable for all k (or a large range of values of k), especially if the graph is not vertex-transitive. The star graphs are proposed in =-=[1]-=- as good alternatives to hypercubes for interprocessor communication. Like the hypercubes, the star graphs are Cayley graphs which are edge-transitive. The edge10 transitivity makes it easy to modify ... |

35 |
Reliable broadcast in hypercube multicomputers.
- Ramanathan, Shin
- 1988
(Show Context)
Citation Context ...ach edge is independently faulty with probability p [4]. Pelc [18] has studied a model in which both nodes and calls can fail. Several other papers have investigated broadcasting in faulty hypercubes =-=[5, 10, 11, 20]-=-. For a survey of work on broadcasting and related problems, see [14]. 2 Definitions Given a graph G = (V; E), the k-reliable broadcast time of a vertex u of G, denoted t k (u), is the minimum time re... |

18 |
Minimum broadcast networks
- Farley
(Show Context)
Citation Context ...in the presence of link failures of long duration [6, 12, 13, 16, 17, 19]. Berman and Hawrylycz considered broadcasting from a single specified originator in the presence of link failures [3]. Farley =-=[8]-=- and Farley and Proskurowski [9] studied broadcasting in the presence of non-adjacent link and/or vertex failures. Bienstock considered broadcasting in a model in which each edge is independently faul... |

18 |
Asymptotically optimal broadcasting and gossiping in faulty hypercube multicomputers
- Fraigniaud
- 1992
(Show Context)
Citation Context ...ach edge is independently faulty with probability p [4]. Pelc [18] has studied a model in which both nodes and calls can fail. Several other papers have investigated broadcasting in faulty hypercubes =-=[5, 10, 11, 20]-=-. For a survey of work on broadcasting and related problems, see [14]. 2 Definitions Given a graph G = (V; E), the k-reliable broadcast time of a vertex u of G, denoted t k (u), is the minimum time re... |

17 |
Telephone Problems with Failures
- Berman, Hawrycz
- 1986
(Show Context)
Citation Context ...roadcasting in the presence of link failures of long duration [6, 12, 13, 16, 17, 19]. Berman and Hawrylycz considered broadcasting from a single specified originator in the presence of link failures =-=[3]-=-. Farley [8] and Farley and Proskurowski [9] studied broadcasting in the presence of non-adjacent link and/or vertex failures. Bienstock considered broadcasting in a model in which each edge is indepe... |

13 |
Broadcasting with random faults
- Bienstock
- 1988
(Show Context)
Citation Context ...rowski [9] studied broadcasting in the presence of non-adjacent link and/or vertex failures. Bienstock considered broadcasting in a model in which each edge is independently faulty with probability p =-=[4]-=-. Pelc [18] has studied a model in which both nodes and calls can fail. Several other papers have investigated broadcasting in faulty hypercubes [5, 10, 11, 20]. For a survey of work on broadcasting a... |

12 | Algebraic constructions of efficient broadcast networks, in
- Dinneen, Fellows, et al.
- 1991
(Show Context)
Citation Context ...Gamma1 = x \Gamma1 . We say that two nodes z and y are dimension i neighbors if y = zffx 2 i \Gamma1 . This family of graphs was recently shown to be a family of (0-reliable) minimum broadcast graphs =-=[7, 15]-=-. In this paper, we have adopted the notation from [7]. 5 In the m+ 1 time 0-reliable broadcast scheme for Gm presented in [15] and [7], each informed vertex calls its dimension j neighbor at time j +... |

10 |
Tighter Time Bounds on Fault--Tolerant Broadcasting and Gossiping
- Gargano
- 1992
(Show Context)
Citation Context ...is a constant. Previous research into fault-tolerant broadcasting has focused on other types of faults. Several papers have investigated broadcasting in the presence of link failures of long duration =-=[6, 12, 13, 16, 17, 19]-=-. Berman and Hawrylycz considered broadcasting from a single specified originator in the presence of link failures [3]. Farley [8] and Farley and Proskurowski [9] studied broadcasting in the presence ... |

8 |
Networks immune to isolated failures
- Farley
(Show Context)
Citation Context ... of long duration [6, 12, 13, 16, 17, 19]. Berman and Hawrylycz considered broadcasting from a single specified originator in the presence of link failures [3]. Farley [8] and Farley and Proskurowski =-=[9]-=- studied broadcasting in the presence of non-adjacent link and/or vertex failures. Bienstock considered broadcasting in a model in which each edge is independently faulty with probability p [4]. Pelc ... |

7 |
Fault-tolerant broadcast graphs, Networks 15
- Liestman
- 1985
(Show Context)
Citation Context ...is a constant. Previous research into fault-tolerant broadcasting has focused on other types of faults. Several papers have investigated broadcasting in the presence of link failures of long duration =-=[6, 12, 13, 16, 17, 19]-=-. Berman and Hawrylycz considered broadcasting from a single specified originator in the presence of link failures [3]. Farley [8] and Farley and Proskurowski [9] studied broadcasting in the presence ... |

5 |
Optimal broadcasting in faulty hypercubes via edge-disjoint embeddings
- Bruck
- 1989
(Show Context)
Citation Context ...ach edge is independently faulty with probability p [4]. Pelc [18] has studied a model in which both nodes and calls can fail. Several other papers have investigated broadcasting in faulty hypercubes =-=[5, 10, 11, 20]-=-. For a survey of work on broadcasting and related problems, see [14]. 2 Definitions Given a graph G = (V; E), the k-reliable broadcast time of a vertex u of G, denoted t k (u), is the minimum time re... |

5 |
Constructing Fault-Tolerant Minimal Broadcast Networks
- Chau, Liestman
- 1986
(Show Context)
Citation Context ...is a constant. Previous research into fault-tolerant broadcasting has focused on other types of faults. Several papers have investigated broadcasting in the presence of link failures of long duration =-=[6, 12, 13, 16, 17, 19]-=-. Berman and Hawrylycz considered broadcasting from a single specified originator in the presence of link failures [3]. Farley [8] and Farley and Proskurowski [9] studied broadcasting in the presence ... |

5 |
A Survey of Broadcasting and Gossiping
- Hedetniemi, Hedetniemi, et al.
- 1988
(Show Context)
Citation Context ... model in which both nodes and calls can fail. Several other papers have investigated broadcasting in faulty hypercubes [5, 10, 11, 20]. For a survey of work on broadcasting and related problems, see =-=[14]-=-. 2 Definitions Given a graph G = (V; E), the k-reliable broadcast time of a vertex u of G, denoted t k (u), is the minimum time required to guarantee broadcast from u in the presence of up to k trans... |

4 |
Minimum time broadcast networks tolerating a logarithmic number of faults
- Gargano, Vaccaro
- 1992
(Show Context)
Citation Context |

4 |
Broadcasting in complete networks with faulty nodes using unreliable calls
- Pelc
- 1991
(Show Context)
Citation Context ... studied broadcasting in the presence of non-adjacent link and/or vertex failures. Bienstock considered broadcasting in a model in which each edge is independently faulty with probability p [4]. Pelc =-=[18]-=- has studied a model in which both nodes and calls can fail. Several other papers have investigated broadcasting in faulty hypercubes [5, 10, 11, 20]. For a survey of work on broadcasting and related ... |

1 |
Broadcasting in a Hypercube When Some
- Fraigniaud, Peyrat
- 1991
(Show Context)
Citation Context |

1 |
Algoritmi per la Costruzione di Networks Fault-tolerant, M.Sc. thesis, Universita di
- Maddaluno
- 1987
(Show Context)
Citation Context |