Rapid Almost-Complete Broadcasting in Faulty Networks

DOI10.1007/978-3-540-72951-8_20zbMATH Open1201.68020OpenAlexW2201064483MaRDI QIDQ5425974FDOQ5425974

Authors: Rastislav Královič, Richard Královič 

Publication date: 15 November 2007

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72951-8_20

Recommendations

• Rapid almost-complete broadcasting in faulty networks
• Communication-efficient broadcasting in complete networks with dynamic faults
• Broadcasting in synchronous networks with dynamic faults
• On fractional dynamic faults with thresholds
• Time bounds on fault‐tolerant broadcasting

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cited In (9)

• Fault-tolerant broadcasting and gossiping in communication networks
• Broadcasting with random faults
• On Fractional Dynamic Faults with Threshold
• Rapid almost-complete broadcasting in faulty networks
• Broadcasting in complete networks with faulty nodes using unreliable calls
• Title not available (Why is that?)
• Minimum time broadcast in faulty star networks
• Deterministic Models of Communication Faults
• Communication-efficient broadcasting in complete networks with dynamic faults

This page was built for publication: Rapid Almost-Complete Broadcasting in Faulty Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425974)