✦ LIBER ✦

Reliable broadcast protocols in unreliable networks

✍ Scribed by Baruch Awerbuch; Shilmon Event

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 859 KB
Volume: 16
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230160405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reliable broadcasting in double loop net

Reliable broadcasting in double loop networks

✍ Nenad Obradoviç; Joseph Peters; Goran Ružić 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

A Distributed Election Protocol for Unre

A Distributed Election Protocol for Unreliable Networks

✍ Junguk L. Kim; Geneva G. Belford 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

This paper presents a broadcast-based election protocol for distributed systems implemented on unreliable networks. The protocol is highly robust, tolerating failures such as message loss and network partitioning. Our protocol is different from others in that it effectively detects events that may p

On unreliability polynomials and graph c

On unreliability polynomials and graph connectivity in reliable network synthesis

✍ F. T. Boesch 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

Scheduling in broadcast networks

✍ Hall, Nicholas G.; Liu, Wei-Ping; Sidney, Jeffrey B. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 325 KB

Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the network. Almost all the work to date uses the unit transmission time assumption, that

A Broadcasting Protocol in Line Digraphs

✍ Jean-Claude Bermond; Xavier Muñoz; Alberto Marchetti-Spaccamela 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 207 KB

We propose broadcasting algorithms for line digraphs in the telegraph model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph L k G, the graph obtained by applying k times, the line digraph operation to G. As a consequence improved bounds fo

Scheduling broadcasts in wireless networ

Scheduling broadcasts in wireless networks

✍ Bala Kalyanasundaram; Kirk R. Pruhs; Mahendran Velauthapillai 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 160 KB

We consider problems involving how to schedule broadcasts in a pulled-based data-dissemination service, such as the DirecPC system, where data requested by the clients is delivered via broadcast. In particular, we consider the case where all the data items are of equal size and preemption is not all