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!
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.
AbstractList 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.
Author Zhang, Yuan
Zhong, Sheng
Author_xml – sequence: 1
  givenname: Sheng
  surname: Zhong
  fullname: Zhong, Sheng
  email: szhong@buffalo.edu, sheng.zhong@gmail.com
– sequence: 2
  givenname: Yuan
  surname: Zhang
  fullname: Zhang, Yuan
BookMark eNp9UNtKAzEUDFLBtvoHPuQHds11N30RSlErFHypzyHNpU3Z3SxJKvbvTa3PwsAZOGeGOTMDkyEMFoBHjGqMcPN0rHuVdehrgjCuUQFqbsAUi5ZULW6aCZgi2oqKtZzdgVlKR4RQ4XwKtstxjOHbFwMfBqi6fYg-H3roQoQ25d_FsIdO-e4ULSzHO7Xznc9nGBzsT132o8oHmKMaUu9TKjb34NapLtmHvzkHn68v29W62ny8va-Wm0oTznNFDLVGmJaWJ3TLhCCMWSKYMIQS7JgulDaOK6e4XlCDd8hwrPBCC050q-gcsKuvjiGlaJ0cYwkczxIjeWlGHuW1GXlpRqIC1BTZ81VmS7Yvb6NM2ttBW-Oj1Vma4P83-AH8HnIx
Cites_doi 10.1137/0212053
10.1145/513800.513802
ContentType Journal Article
Copyright 2011 IMACS
Copyright_xml – notice: 2011 IMACS
DBID AAYXX
CITATION
DOI 10.1016/j.matcom.2011.01.006
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-7166
EndPage 1732
ExternalDocumentID 10_1016_j_matcom_2011_01_006
S0378475411000346
GrantInformation_xml – fundername: NSF
  grantid: CNS-0845149; CCF-0915374
GroupedDBID --K
--M
-~X
.~1
0R~
1B1
1RT
1~.
1~5
29M
4.4
457
4G.
5GY
5VS
63O
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
ABAOU
ABEFU
ABFNM
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ADBBV
ADEZE
ADGUI
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ARUGR
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLZ
HMJ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SBC
SDF
SDG
SES
SEW
SME
SPC
SPCBC
SSB
SSD
SST
SSW
SSZ
T5K
TN5
WUQ
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c255t-2d3ed8d73101c7488244e2848d2321f4c84836f5afa5c93d1b0d51a19c852c7a3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000290980200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0378-4754
IngestDate Sat Nov 29 05:44:19 EST 2025
Fri Feb 23 02:29:20 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Multipath transmission
Polynomial complexity
Error bound
Approximation
Computer network
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c255t-2d3ed8d73101c7488244e2848d2321f4c84836f5afa5c93d1b0d51a19c852c7a3
PageCount 4
ParticipantIDs crossref_primary_10_1016_j_matcom_2011_01_006
elsevier_sciencedirect_doi_10_1016_j_matcom_2011_01_006
PublicationCentury 2000
PublicationDate 2011-05-01
PublicationDateYYYYMMDD 2011-05-01
PublicationDate_xml – month: 05
  year: 2011
  text: 2011-05-01
  day: 01
PublicationDecade 2010
PublicationTitle Mathematics and computers in simulation
PublicationYear 2011
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Provan, Ball (bib0015) 1983; 12
Ye, Krishnamurthy, Tripathi (bib0020) 2003
Park, Corson (bib0010) 1997
P. Papadimitratos, Z. Haas, E. Sirer, Path-set selection in mobile ad hoc networks, in: Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking and Computing, 2002, pp. 1–11.
Ye (10.1016/j.matcom.2011.01.006_bib0020) 2003
10.1016/j.matcom.2011.01.006_bib0005
Provan (10.1016/j.matcom.2011.01.006_bib0015) 1983; 12
Park (10.1016/j.matcom.2011.01.006_bib0010) 1997
References_xml – start-page: 1405
  year: 1997
  end-page: 1413
  ident: bib0010
  article-title: A highly adaptive distributed routing algorithm for mobile wireless networks
  publication-title: Proceedings of IEEE INFOCOM
– start-page: 270
  year: 2003
  end-page: 280
  ident: bib0020
  article-title: A framework for reliable routing in mobile ad hoc networks
  publication-title: Proceedings of IEEE INFOCOM
– reference: P. Papadimitratos, Z. Haas, E. Sirer, Path-set selection in mobile ad hoc networks, in: Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking and Computing, 2002, pp. 1–11.
– volume: 12
  start-page: 777
  year: 1983
  end-page: 788
  ident: bib0015
  article-title: The complexity of counting cuts and computing the probability that a graph is connected
  publication-title: SIAM Journal on Computing
– volume: 12
  start-page: 777
  issue: 4
  year: 1983
  ident: 10.1016/j.matcom.2011.01.006_bib0015
  article-title: The complexity of counting cuts and computing the probability that a graph is connected
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0212053
– start-page: 1405
  year: 1997
  ident: 10.1016/j.matcom.2011.01.006_bib0010
  article-title: A highly adaptive distributed routing algorithm for mobile wireless networks
– start-page: 270
  year: 2003
  ident: 10.1016/j.matcom.2011.01.006_bib0020
  article-title: A framework for reliable routing in mobile ad hoc networks
– ident: 10.1016/j.matcom.2011.01.006_bib0005
  doi: 10.1145/513800.513802
SSID ssj0007545
Score 1.8865614
Snippet In a computer network where nodes can fail, multipath transmission can be used to increase the probability of successful transmission. However, even multipath...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 1729
SubjectTerms Approximation
Computer network
Error bound
Multipath transmission
Polynomial complexity
Title Approximation algorithm for estimating failure probability of multipath transmission
URI https://dx.doi.org/10.1016/j.matcom.2011.01.006
Volume 81
WOSCitedRecordID wos000290980200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect
  customDbUrl:
  eissn: 1872-7166
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007545
  issn: 0378-4754
  databaseCode: AIEXJ
  dateStart: 19950501
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELeg44EXvtHGl_zAG8pkJ3FsP1ZoCHiYkFak8hS5Z4d1Yum0dKh_PufYToKKECAhVVGUxGni-_XufP3dHSGvc82cqFyTOS5kVkrIs1VTVBk4MNLmAAxY32xCnp6q5VJ_isGcrm8nINtW7Xb66r-KGo-hsH3q7F-Ie7gpHsB9FDpuUey4_SPBz32V8N06pCS-Md--bnD9f34ZanvjD9qf8OxJs_aMdE_QWoVa3eG_9p5gaHxw1lsxREGXJJf6Pg2FXruUFNf3heiJtd36MvYDGyPSkfR7du6ilZzGqb_cRHjaMZQqppGH_ZSYkIYlfbguVIY-dkGrKoluPA_tVZLaDZ1aIrz0RIeiS6Un9pjLEADd0_Uh7HBxjG_siT-hGiv3RL3Rtg2MwzP_XP6xfIk8VpTVbXKQS6HVjBzMP5wsPw7mG6_pea_pPVK-ZU8K3P-uX_szEx9l8YDci4sLOg-geEhuufYRuZ8ad9Coxx-TxU8YoQNGKGKEjhihESN0ghG6aeiAETrFyBPy-d3J4u37LLbXyADXkdsst4Wzykp08DlIVOTo6Tn0VpRFL5s3JeBuUTXCNEaALixfMSu44RqUyEGa4imZtZvWHRJaMVc2Qq8MDi-VAGW1LS2TIIELKPIjkqVJqq9CFZU60Qsv6jCptZ_UmuGHVUdEppmsoycYPLwahf_bkc_-eeRzcncE-Qsy217fuJfkDnzfrrvrVxElPwCEC4lR
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Approximation+algorithm+for+estimating+failure+probability+of+multipath+transmission&rft.jtitle=Mathematics+and+computers+in+simulation&rft.au=Zhong%2C+Sheng&rft.au=Zhang%2C+Yuan&rft.date=2011-05-01&rft.pub=Elsevier+B.V&rft.issn=0378-4754&rft.eissn=1872-7166&rft.volume=81&rft.issue=9&rft.spage=1729&rft.epage=1732&rft_id=info:doi/10.1016%2Fj.matcom.2011.01.006&rft.externalDocID=S0378475411000346
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0378-4754&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0378-4754&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0378-4754&client=summon