On optimal broadcasting in faulty hypercubes

DOI10.1016/0166-218X(94)90175-9MaRDI QIDQ1339875zbMATH OpenFDO

Authors Jehoshua Bruck

Publication date 11 December 1994

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

Full work available at URL https://doi.org/10.1016/0166-218X(94)90175-9

zbMATH Keywords

\(n\)-cubehypercubespanning trees

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Optimal broadcasting in hypercubes with dynamic faults
• A note on optimal time broadcast in faulty hypercubes
• scientific article; zbMATH DE number 1420908

Cites work

• A note on optimal time broadcast in faulty hypercubes
• A survey of gossiping and broadcasting in communication networks
• Broadcasting with random faults
• Fault-tolerant broadcast graphs
• Optimum broadcasting and personalized communication in hypercubes
• Randomized broadcast in networks
• Time bounds on fault‐tolerant broadcasting

Cited in

(26)

• Rapid almost-complete broadcasting in faulty networks
• How robust is the n-cube?
• Efficient broadcasting with linearly bounded faults
• Symmetric flows and broadcasting in hypercubes
• Reliable broadcasting
• Optimal broadcasting in injured hypercubes using directed safety levels.
• Dynamic faults have small effect on broadcasting in hypercubes.
• Optimal broadcasting in faulty trees
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
• A note on optimal time broadcast in faulty hypercubes
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Broadcasting in hypercubes and star graphs with dynamic faults.
• A fully decentralized and oblivious multi-node broadcast algorithm in hypercubes
• Deterministic Models of Communication Faults
• Optimal broadcasting for locally twisted cubes
• scientific article; zbMATH DE number 1138357 (Why is no real title available?)
• Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
• scientific article; zbMATH DE number 1964078 (Why is no real title available?)
• A fault-tolerant tree communication scheme for hypercube systems
• A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
• scientific article; zbMATH DE number 1875436 (Why is no real title available?)
• Fault—tolerant hypercube broadcasting via information dispersal
• Minimizing message complexity of partially replicated data on hypercubes
• Broadcasting in hypercubes with randomly distributed Byzantine faults
• Hierarchical spanning trees and distributing on incomplete hypercubes
• Improved one-to-all broadcasting algorithms on faulty SIMD hypercubes

This page was built for publication: On optimal broadcasting in faulty hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339875)