Fault-tolerant broadcasting and gossiping in communication networks
From MaRDI portal
Publication:5689809
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N" /><143::AID-NET3>3.0.CO;2-N 10.1002/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-NzbMath0865.90058OpenAlexW2063105299MaRDI QIDQ5689809
Publication date: 6 July 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199610)28:3<143::aid-net3>3.0.co;2-n
Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (36)
Binary linear programming models for robust broadcasting in communication networks ⋮ Invited talk: Resilient distributed algorithms ⋮ Broadcasting with locally bounded byzantine faults ⋮ Fault-tolerant sequential scan ⋮ A SURVEY ON UNDIRECTED CIRCULANT GRAPHS ⋮ A note on broadcasting with linearly bounded transmission faults in constant degree networks ⋮ Robust gossiping with an application to consensus ⋮ Feasibility and complexity of broadcasting with random transmission failures ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ Computing input multiplicity in anonymous synchronous networks with dynamic faults ⋮ Reliable broadcasting in product networks ⋮ A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS ⋮ Confidential gossip ⋮ Dynamic faults have small effect on broadcasting in hypercubes. ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Efficient communication in unknown networks ⋮ \(f\)-sensitivity distance oracles and routing schemes ⋮ Deterministic Models of Communication Faults ⋮ New bounds on the minimum number of calls in failure‐tolerant gossiping ⋮ The diameter and connectivity of networks with random dependent faults ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Communication complexity of fault-tolerant information diffusion ⋮ A new parameter for a broadcast algorithm with locally bounded Byzantine faults ⋮ Efficient broadcasting with linearly bounded faults ⋮ Asynchronous Broadcasting with Bivalent Beeps ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ The parameterized complexity of the minimum shared edges problem ⋮ Efficient collective communciation in optical networks ⋮ A probabilistic characterization of a fault-tolerant gossiping algorithm ⋮ Unnamed Item ⋮ Compound constructions of broadcast networks ⋮ FAST BROADCASTING WITH BYZANTINE FAULTS ⋮ Efficient gossip and robust distributed computation ⋮ Broadcasting in hypercubes and star graphs with dynamic faults. ⋮ Verifiable broadcasting and gossiping in communication networks
This page was built for publication: Fault-tolerant broadcasting and gossiping in communication networks
