Reliable broadcasting in product networks

DOI10.1016/S0166-218X(97)00100-5zbMath0901.68008MaRDI QIDQ1392523

Sabine R. Öhring, Feng Bao, Yoshihide Igarashi

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

reliability of broadcasting

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Applications of graph theory to circuits and networks (94C15)

Related Items (22)

Unnamed Item ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Independent spanning trees on twisted cubes ⋮ Resource placement in Cartesian product of networks ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ Constructing independent spanning trees for locally twisted cubes ⋮ Rainbow vertex-connection and graph products ⋮ Independent spanning trees on even networks ⋮ CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2) ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Monochromatic connectivity and graph products ⋮ Path-connectivity of lexicographic product graphs ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Linear \(k\)-arboricity of Caylay graphs on abelian groups with given degree ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ A multi-tree routing scheme using acyclic orientations ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks ⋮ Independent spanning trees in crossed cubes

Cites Work

• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• Broadcasting with random faults
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Three tree-paths
• A survey of gossiping and broadcasting in communication networks
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Reliable communication in networks with Byzantine link failures
• Optimal communication in networks with randomly distributed byzantine faults
• Information dissemination in distributed systems with faulty units
• Fault—tolerant hypercube broadcasting via information dispersal
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Reliable broadcasting in product networks