Fault—tolerant hypercube broadcasting via information dispersal

DOI10.1002/NET.3230230409zbMATH Open0779.90027OpenAlexW2086999035MaRDI QIDQ5289370FDOQ5289370

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

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

zbMATH Keywords

hypercubebroadcastingRabin's information dispersal algorithmtransmission or link failures

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (10)

• Broadcasting in hypercubes with randomly distributed Byzantine faults
• Optimal broadcasting in injured hypercubes using directed safety levels.
• A fault-tolerant communication scheme for hypercube computers
• Communication complexity of fault-tolerant information diffusion
• A note on optimal time broadcast in faulty hypercubes
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Minimum time broadcast in faulty star networks
• Title not available (Why is that?)
• Fault-tolerant broadcasts
• Reliable broadcasting in product networks

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)