Abstract
Service-level agreements for data transmission often define criteria such as availability, delay, and loss. Internet service providers and enterprise customers are increasingly focusing on tolerable error rate during transmission. Focusing on a stochastic flow network (SFN), this study extends reliability evaluation to considering tolerable error rate, in which network reliability is the probability that demand can be satisfied. In such an SFN, each component (branch or node) has several capacities and a transmission error rate. Network reliability can be regarded as a performance index for assessing the SFN. We propose an efficient algorithm based on minimal paths to find all minimal capacity vectors that allow the network to transmit d units of data under tolerable error rate E. Network reliability is computed in terms of such vectors by the recursive sum of disjoint products algorithm. The proposed algorithm is tested for a benchmark network and the National Science Foundation Network. The computational complexity of the proposed algorithm is analyzed as well.
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 callDisclaimer: 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.
