Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate

DOI10.1007/s10479-014-1673-8zbMath1386.68024OpenAlexW1990306398MaRDI QIDQ331848

Yi-Kuei Lin, Cheng-Fu Huang

Publication date: 27 October 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1673-8

zbMATH Keywords

system reliabilityrouting schemeassured accuracy ratemulti-state computer network (MSCN)quickest path (QP)transmission time

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Reliability of a stochastic intermodal logistics network under spoilage and time considerations

Cites Work

• Unnamed Item
• Radio resource management for the UMTS enhanced uplink in presence of QoS radio bearers
• The quickest path problem
• Time version of the shortest path problem in a stochastic-flow network
• Lower bounds on two-terminal network reliability
• Distributed algorithms for the quickest path problem
• An algorithm for the quickest path problem
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• A label-setting algorithm for finding a quickest path
• On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
• The cross-entropy method for network reliability estimation
• Reliability Evaluation of Multistate Systems with Multistate Components
• Reliability evaluation of a limited-flow network in terms of minimal cutsets
• On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets

This page was built for publication: Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate