Reliability evaluation subject to assured accuracy rate and time for stochastic unreliable-node computer networks

DOI10.1080/00949655.2012.751988zbMath1453.90057OpenAlexW2039202845MaRDI QIDQ5220004

Cheng-Fu Huang, Yi-Kuei Lin

Publication date: 9 March 2020

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949655.2012.751988

zbMATH Keywords

system reliabilitylead timeaccuracy rategraphic techniquepacket loststochastic unreliable-node computer network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• Unnamed Item
• Internet packet routing: application of a \(K\)-quickest path algorithm
• The quickest path problem
• Lower bounds on two-terminal network reliability
• Distributed algorithms for the quickest path problem
• An algorithm for finding the \(k\) quickest paths in a network
• On the quickest path problem
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• An algorithm for the quickest path problem
• Minimum time paths in a network with mixed time constraints.
• Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network
• A label-setting algorithm for finding a quickest path
• An algorithm for ranking quickest simple paths
• The all-pairs quickest path problem
• On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
• Statistical estimation of internal available bandwidth
• 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 subject to assured accuracy rate and time for stochastic unreliable-node computer networks