Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Communications in Statistics - Simulation and Computation
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
