Approximation algorithm for estimating failure probability of multipath transmission

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 imp...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics and computers in simulation Ročník 81; číslo 9; s. 1729 - 1732
Hlavní autoři: Zhong, Sheng, Zhang, Yuan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.05.2011
Témata:
Approximation
Computer network
Error bound
Multipath transmission
Polynomial complexity
Multipath transmission
Polynomial complexity
Error bound
Approximation
Computer network
ISSN:0378-4754, 1872-7166
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0378-4754
1872-7166
DOI:10.1016/j.matcom.2011.01.006