Communication in Networks with Random Dependent Faults

DOI10.1007/978-3-540-74456-6_38MaRDI QIDQ3525589zbMATH OpenOpenAlexFDO

Authors Michel Paquette, Andrzej Pelc, Evangelos Kranakis

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_38

zbMATH Keywords

communicationcrash faultsdependent faultsfault-tolerancenetwork connectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18)

Recommendations

• The diameter and connectivity of networks with random dependent faults
• Efficient Gossiping by Packets in Networks with Random Faults
• Reliable communication in networks with Byzantine link failures
• Broadcasting with random faults
• Construction of the mesh and the torus tolerating a large number of faults

Cited in

(4)

• The diameter and connectivity of networks with random dependent faults
• Deterministic Models of Communication Faults
• On flooding in the presence of random faults
• Resilience of communication networks to random failures and disasters: An optimization perspective

This page was built for publication: Communication in Networks with Random Dependent Faults

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