摘要

Error rate and transmission time are both critical factors in a computer system. In addition to guarantee the robustness of the computer system under both tolerable error rate and latency, enhancing the system reliability by a routing scheme, named spare reliability, is also a critical task. Virtually, each branch possesses multiple possible capacities. Such a network is termed a capacitated computer network (CCN). Hence, this article develops an efficient algorithm to derive the spare reliability of a CCN, where the spare reliability is the probability that data can be sent through multiple minimal paths considering routing scheme.

  • 出版日期2014-9-14

全文