Optimal communication in networks with randomly distributed byzantine faults

DOI10.1002/NET.3230230807zbMath0802.90042OpenAlexW2042873483MaRDI QIDQ4291477

Douglas M. Blough, Andrzej Pelc

Publication date: 9 May 1994

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

communication networkByzantine faultsefficient information exchangenonadaptive almost-safe communication schemes

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (7)

Broadcasting with locally bounded byzantine faults ⋮ Feasibility and complexity of broadcasting with random transmission failures ⋮ Reliable broadcasting in product networks ⋮ Broadcasting in hypercubes with randomly distributed Byzantine faults ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ FAST BROADCASTING WITH BYZANTINE FAULTS

This page was built for publication: Optimal communication in networks with randomly distributed byzantine faults