Reliable Broadcasting in Hypercubes with Random Link and Node Failures

DOI10.1017/S0963548300002108zbMath0863.68014OpenAlexW2031578616MaRDI QIDQ2785368

Krzysztof Diks, Bogdan S. Chlebus, Andrzej Pelc

Publication date: 22 May 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300002108

zbMATH Keywords

hypercubebroadcasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Random induced subgraphs of Cayley graphs induced by transpositions, Almost-everywhere secure computation with edge corruptions, The diameter and connectivity of networks with random dependent faults

Cites Work

• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• A guided tour of Chernoff bounds
• Optimal and near-optimal broadcast in random graphs
• Broadcasting with random faults
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Broadcasting in complete networks with faulty nodes using unreliable calls
• On Gossiping with Faulty Telephone Lines
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time
• Fast Gossiping for the Hypercube
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks