Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations

DOI10.1080/03610918.2013.810259zbMath1295.81042OpenAlexW2048011514MaRDI QIDQ2876110

Cheng-Fu Huang, Yi-Kuei Lin

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

zbMATH Keywords

routing schemelatencycapacitated computer network (CCN)spare reliabilitytolerable error rate

Mathematics Subject Classification ID

Quantum computation (81P68) Other types of codes (94B60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (1)

A dynamic delay-based reliability evaluation model for communication networks

Cites Work

• Unnamed Item
• Internet packet routing: application of a \(K\)-quickest path algorithm
• 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 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
• Calculation of minimal capacity vectors through \(k\) minimal paths under budget and time constraints
• On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint
• Measure the quality level for a supplier-demand system by a multicommodity stochastic-flow network
• Asymptotic Inference for Waiting Times and Patiences in Queues with Abandonment
• Bayesian Analysis of a Queueing System with a Long-Tailed Arrival Process
• 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: Spare Reliability for Capacitated Computer Networks Under Tolerable Error Rate and Latency Considerations