2009
DOI: 10.1016/j.comcom.2009.05.001
|View full text |Cite
|
Sign up to set email alerts
|

Concurrent Multipath Transfer during path failure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 45 publications
(34 citation statements)
references
References 14 publications
0
29
0
Order By: Relevance
“…Performance evaluation: Citation revisited: Natarajan et al (2009)Computer Communications 32 (2009) 1577-1587, In page 1579 Fig. 2, in Path 2after SACK received for TSN 3, later transmitting TSN 5, the cwnd c = 2 is correct, because C i and O i is maintained per destination basis only, similarly Fig.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Performance evaluation: Citation revisited: Natarajan et al (2009)Computer Communications 32 (2009) 1577-1587, In page 1579 Fig. 2, in Path 2after SACK received for TSN 3, later transmitting TSN 5, the cwnd c = 2 is correct, because C i and O i is maintained per destination basis only, similarly Fig.…”
Section: Resultsmentioning
confidence: 99%
“…Permanent receiver buffer blocking in CMT-PF: Natarajan et al (2009), claims for mitigating the failureinduced receiver buffer (rbuf) blocking problem by introducing a new "" Potentially-Failed" (CMT-PF) and improved the performance of data transmission comparing with receiver buffer blocking in CMT. When using three paths their failure induced rbuf problem depicted through their experiment resulted permanent receiver blocking, which is explained via time line diagram of Fig.…”
Section: Problem Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…CMT-PF marks the path that has experienced a failure (a single timeout) as potentially failed and stops transmitting data on such a path until a positive heartbeat probe is returned. An extensive evaluation of CMT-PF presented in Natarajan et al [2009] shows that the proposed solution performs better or similar but never worse than CMT. The CMT-PF proposal has been conceived for lossy network scenarios, although not particularly designed with wireless networks in mind, thus facilitating the idea of applying CMT to also improve transport layer handover.…”
Section: Loadsharingmentioning
confidence: 99%
“…To address this problem, this document specifies a quick failover algorithm called "SCTP-PF" based on the introduction of a new Potentially Failed (PF) path state in SCTP path management. The performance deficiencies of the failover operation described in RFC 4960, and the improvements obtainable from the introduction of a PF state in SCTP, were proposed and documented in [NATARAJAN09] for Concurrent Multipath Transfer SCTP [IYENGAR06].…”
Section: Introductionmentioning
confidence: 99%