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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics and computers in simulation Jg. 81; H. 9; S. 1729 - 1732
Hauptverfasser: Zhong, Sheng, Zhang, Yuan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.05.2011
Schlagworte:
Approximation
Computer network
Error bound
Multipath transmission
Polynomial complexity
Multipath transmission
Polynomial complexity
Error bound
Approximation
Computer network
ISSN:0378-4754, 1872-7166
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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