scientific article; zbMATH DE number 1161336

MaRDI QIDQ4393334zbMATH OpenFDO

Authors F. T. Boesch, Charles L. Suffel, Daniel J. Gross

Publication date 19 October 1998

zbMATH Keywords

multiprocessor networksreliabilityresidual node connectivity model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• A Reliability Bound for Systems of Maintained, Interdependent Components
• A note on bounding \(k\)-terminal reliability
• On the Reliability of an n-Component System
• Bounds for Reliability of Large Consecutive-K-out-of-N:F Systems with Unequal Component Reliability
• Reliability Bounds for Fault-Tolerant Systems with Competing Responses to Component Failures
• Reliability Bounds for Multistate Systems with Multistate Components
• Algorithms for K-terminal reliability problems with node failures
• Asymptotic reliability theory of \(k\)-out-of-\(n\) systems
• scientific article; zbMATH DE number 6751498
• Upper and Lower Bounds for the Reliability of a Consecutive-k-out-of-n:F System

Cited in

(6)

• Network connectivity under node failure
• scientific article; zbMATH DE number 176250 (Why is no real title available?)
• scientific article; zbMATH DE number 1472195 (Why is no real title available?)
• A Hostile model for network reliability analysis
• Binary strings and reliability of path networks
• Dr. Charles L. Suffel: Scholar, teacher, mentor, friend

This page was built for publication:

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