✦ LIBER ✦

Broadcasting with random faults

✍ Scribed by Daniel Bienstock

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 1008 KB
Volume: 20
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90037-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Broadcasting with linearly bounded trans

Broadcasting with linearly bounded transmission faults

✍ L. Ga̧sieniec; A. Pelc 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 838 KB

We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < CI < 1 we assume that at most ai faulty transmissions can occur during the first i time units of the communication process, for every natural number i. Every informed node can transmit info

Broadcasting in synchronous networks wit

Broadcasting in synchronous networks with dynamic faults

✍ Chlebus, B. S.; Diks, K.; Pelc, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 876 KB

The problem of broadcasting in a network is to disseminate information from one node to all other nodes by transmitting it over communication links that connect nodes. We consider the time of broadcasting in the presence of at most k dynamic link failures. If a node knows source information, then in

Fault-tolerant broadcasts

✍ Fred B. Schneider; David Gries; Richard D. Schlichting 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 925 KB

Communication-Efficient Broadcasting in

Communication-Efficient Broadcasting in Complete Networks with Dynamic Faults

✍ Stefan Dobrev 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 195 KB

Fault-tolerant broadcast graphs

✍ Arthur L. Liestman 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 555 KB

Broadcasting in random graphs

✍ Alan Frieze; Michael Molloy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 163 KB