| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1139929 | Mathematics and Computers in Simulation | 2011 | 4 Pages |
Abstract
In a computer network where nodes can fail, multipath transmission can be used to increase the probability of successful transmission. However, even multipath transmission has a probability of failure, which depends on the selected paths. Hence, estimating this probability of failure is of great importance for designing good multipath routing algorithms. In this paper, we show that it is NP-hard to compute the failure probability of multipath transmission. Therefore, we design a polynomial-time approximation algorithm for estimating this failure probability and give analysis of its error bounds. We also compare the results of our approximation algorithm with the results of Matlab simulations.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Sheng Zhong, Yuan Zhang,