Reliable communication in networks with Byzantine link failures
From MaRDI portal
Publication:4014611
DOI10.1002/net.3230220503zbMath0768.90027OpenAlexW1985490338MaRDI QIDQ4014611
Publication date: 13 October 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230220503
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (8)
Fast gossiping with short unreliable messages ⋮ Reliable broadcasting in product networks ⋮ Broadcasting in hypercubes with randomly distributed Byzantine faults ⋮ Distributed computations in fully-defective networks ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise
Cites Work
This page was built for publication: Reliable communication in networks with Byzantine link failures
