Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
DOI10.1080/03610918.2013.810259zbMATH Open1295.81042OpenAlexW2048011514MaRDI QIDQ2876110FDOQ2876110
Authors: Yi-Kuei Lin, Cheng-Fu Huang 
Publication date: 18 August 2014
Published in: Communications in Statistics. Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2013.810259
Recommendations
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Backup reliability assessment within tolerable packet error rate for a multi-state unreliable vertex computer network
- Backup reliability of stochastic imperfect-node computer networks subject to packet accuracy rate and time constraints
Quantum computation (81P68) Reliability, testing and fault tolerance of networks and computer systems (68M15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- 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
- 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
- The quickest path problem
- Asymptotic Inference for Waiting Times and Patiences in Queues with Abandonment
- On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
- 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
- Minimum time paths in a network with mixed time constraints.
- Reliability Evaluation of Multistate Systems with Multistate Components
- On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets
- Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
- Internet packet routing: application of a \(K\)-quickest path algorithm
- Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
- Bayesian Analysis of a Queueing System with a Long-Tailed Arrival Process
Cited In (4)
- A dynamic delay-based reliability evaluation model for communication networks
- Economic spare capacity planning for DCS mesh-restorable networks
- Assessment of spare reliability for multi-state computer networks within tolerable packet unreliability
- Reliability assessment of a stochastic node-failure network with multiple sinks under tolerable error rate
This page was built for publication: Spare reliability for capacitated computer networks under tolerable error rate and latency considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876110)
