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.
| Original language | English |
|---|---|
| Pages (from-to) | 57-73 |
| Number of pages | 17 |
| Journal | Quality Technology and Quantitative Management |
| Volume | 10 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2013 |
Keywords
- Network reliability
- Recursive sum of disjoint products (RSDP)
- Service level agreements (SLAs)
- Stochastic flow network (SFN)
- Tolerable error rate
UN SDGs
This output contributes to the following Sustainable Development Goal(s)
