On the Fault Tolerance of Some Popular Bounded-Degree Networks

DOI10.1137/S0097539793255163zbMATH Open0907.68004OpenAlexW2116777327MaRDI QIDQ4210098FDOQ4210098

Authors: Bruce M. Maggs, Ramesh K. Sitaraman, F. Thomson Leighton 

Publication date: 20 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793255163

Recommendations

• On the fault tolerance of the butterfly
• scientific article; zbMATH DE number 1760005
• Fault-Tolerant Meshes with Small Degree
• Sparse networks tolerating random faults.

zbMATH Keywords

butterfly networkfault tolerancenetwork emulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Reliability, testing and fault tolerance of networks and computer systems (68M15) Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10)

Cited In (13)

• Fault-tolerant analysis of a class of networks
• Cycles in butterfly graphs
• Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
• Sparse networks tolerating random faults.
• (\(k,+\))-distance-hereditary graphs
• Title not available (Why is that?)
• Networks with small stretch number
• Minimum spanners of butterfly graphs
• On the fault tolerance of the butterfly
• Large fault-tolerant interconnection networks
• Self-spanner graphs
• Title not available (Why is that?)
• Reconfiguring Arrays with Faults Part I: Worst-Case Faults

This page was built for publication: On the Fault Tolerance of Some Popular Bounded-Degree Networks

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