Minimum congestion redundant assignments to tolerate random faults

DOI10.1007/S00453-001-0080-0zbMATH Open1009.68182OpenAlexW1503513092MaRDI QIDQ1348940FDOQ1348940

Authors: Dimitris Fotakis, P. G. Spirakis 

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0080-0

Recommendations

• On Minimum Fault-Tolerant Networks
• Minimizing congestion of layouts for ATM networks with faulty links
• Minimal selectors and fault tolerant networks
• scientific article; zbMATH DE number 961881
• Unconstrained and constrained fault-tolerant resource allocation
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Opttimal allocation of redundancy in a mixed system
• Optimal task allocation and hardware redundancy policies in distributed computing systems
• scientific article; zbMATH DE number 1775423

zbMATH Keywords

fault-tolerancefaulty channels

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (3)

• On redundancy elimination tolerant scheduling rules
• Parallel Processing and Applied Mathematics
• Title not available (Why is that?)

This page was built for publication: Minimum congestion redundant assignments to tolerate random faults

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