Fault-tolerant logical network structures

MaRDI QIDQ4967205zbMATH OpenFDO

Authors M. Parter

Publication date 3 July 2019

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Communication structures in fault‐tolerant distributed systems
• Sparse networks tolerating random faults.
• scientific article; zbMATH DE number 913541
• On Minimum Fault-Tolerant Networks

Cited in

(12)

• An extensible fault-tolerant network architecture
• Fault-tolerant approximate shortest-path trees
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Structure fault tolerance of WK-recursive networks
• Bounding Fan-out in Logical Networks
• Dynamically Restructurable Fault-Tolerant Processor Network Architectures
• Connectivity oracles for graphs subject to vertex failures
• Fault-tolerant subgraph for single-source reachability: general and optimal
• Communication structures in fault‐tolerant distributed systems
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set
• Constant factor approximation for tracking paths and fault tolerant feedback vertex set
• Invited talk: Resilient distributed algorithms

This page was built for publication: Fault-tolerant logical network structures

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