Component-level redundancy is better than system-level redundancy for channel graphs

DOI10.1002/NET.3230150406MaRDI QIDQ3787775zbMATH OpenOpenAlexFDO

Authors Larry Shepp, Frank K. Hwang

Publication date 1985

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230150406

zbMATH Keywords

2-port networkblocking probabilitieschannel graphscomponent-level redundancyparallel synthesisparallel-sequential-parallel synthesissequential synthesissystem-level redundancy

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Component and system active redundancies for coherent systems with dependent components
• Some redundancy results for continuum structure functions
• Assembly at system level versus component level
• scientific article; zbMATH DE number 934892
• More on optimal allocation of components in coherent systems

Cites work

• Inequalities: theory of majorization and its applications

Cited in

(1)

• Generalization of an engineering principle

This page was built for publication: Component-level redundancy is better than system-level redundancy for channel graphs

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