A Broadcasting Protocol in Line Digraphs
✍ Scribed by Jean-Claude Bermond; Xavier Muñoz; Alberto Marchetti-Spaccamela
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 207 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
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 for the broadcasting time in De Bruijn, Kautz, and Wrapped Butterfly digraphs are obtained.
📜 SIMILAR VOLUMES
In this paper, we will propose a causal broadcast protocol for distributed mobile systems. Since the mobile hosts are in general unspecified majority, and the computational capability and communication capability are considerably inferior to the static hosts, an algorithm is desired whose computatio