Information dissemination in distributed systems with faulty units

DOI10.1109/12.286303zbMath1042.68826OpenAlexW2163343233MaRDI QIDQ4420048

Anindo Bagchi, S. Louis Hakimi

Publication date: 1994

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3677bb8eb37aec0353c7f4fa2a092d78c397b621

zbMATH Keywords

spanning treesystem level diagnosis

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (10)

Broadcasting with locally bounded byzantine faults ⋮ Robust gossiping with an application to consensus ⋮ Feasibility and complexity of broadcasting with random transmission failures ⋮ Reliable broadcasting in product networks ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Deterministic Models of Communication Faults ⋮ Rapid almost-complete broadcasting in faulty networks ⋮ Communication complexity of fault-tolerant information diffusion ⋮ FAST BROADCASTING WITH BYZANTINE FAULTS

This page was built for publication: Information dissemination in distributed systems with faulty units