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)

zbMATH Keywords

spanning treeshypercube\(n\)-cube

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

(21)

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

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)