Fault—tolerant hypercube broadcasting via information dispersal

DOI10.1002/NET.3230230409MaRDI QIDQ5289370zbMATH OpenOpenAlexFDO

Authors Adele A. Rescigno, Luisa Gargano, Ugo Vaccaro

Publication date 23 August 1993

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230230409

zbMATH Keywords

broadcastinghypercubeRabin's information dispersal algorithmtransmission or link failures

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Reliable broadcasting in hypercubes with random link and node failures
• Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
• On optimal broadcasting in faulty hypercubes
• Fault-tolerant broadcast graphs

Cited in

(12)

• Communication complexity of fault-tolerant information diffusion
• Reliable broadcasting in product networks
• Minimum time broadcast in faulty star networks
• Optimal broadcasting in injured hypercubes using directed safety levels.
• A note on optimal time broadcast in faulty hypercubes
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Reliable broadcasting in hypercubes with random link and node failures
• Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
• scientific article; zbMATH DE number 1420908 (Why is no real title available?)
• A fault-tolerant communication scheme for hypercube computers
• Broadcasting in hypercubes with randomly distributed Byzantine faults
• Fault-tolerant broadcasts

This page was built for publication: Fault—tolerant hypercube broadcasting via information dispersal

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