2012
DOI: 10.1016/j.jnca.2011.09.004
|View full text |Cite
|
Sign up to set email alerts
|

OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer

Abstract: One major problem of concurrent multi-path transfer (CMT) scheme in multi-homed mobile networks is that the utilization of different paths with diverse delays may cause packet reordering among packets of the same flow. In the case of TCP-like, the reordering exacerbates the problem by bringing more timeouts and unnecessary retransmissions, which eventually degrades the throughput of connections considerably. To address this issue, we first propose an Out-of-order Scheduling for In-order Arriving (OSIA), which … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(7 citation statements)
references
References 40 publications
0
7
0
Order By: Relevance
“…An approach for actively sensing the paths' status and quality is proposed in [102], aiming at addressing the inaccurate estimation of the path latency when assigning the load to each path, caused by the underlying wireless networks. [99], [100], [102], and [101] mainly compare with RR and show the throughput increase ranging from 10% to 40%. The mechanism proposed in [103] is tailored for lossy networks and takes loss rates into account to model and estimate latency and data amount to send on each path.…”
Section: B Multipath Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…An approach for actively sensing the paths' status and quality is proposed in [102], aiming at addressing the inaccurate estimation of the path latency when assigning the load to each path, caused by the underlying wireless networks. [99], [100], [102], and [101] mainly compare with RR and show the throughput increase ranging from 10% to 40%. The mechanism proposed in [103] is tailored for lossy networks and takes loss rates into account to model and estimate latency and data amount to send on each path.…”
Section: B Multipath Schedulingmentioning
confidence: 99%
“…Delay Aware Packet Scheduling (DAPS) [100] assigns the number of packets over each path based on the ratio of RTT between the paths. [101] considers the RTT of different paths for load-balancing at the sender side to specifically rearrange the transmission order of packets. An approach for actively sensing the paths' status and quality is proposed in [102], aiming at addressing the inaccurate estimation of the path latency when assigning the load to each path, caused by the underlying wireless networks.…”
Section: B Multipath Schedulingmentioning
confidence: 99%
“…Liao et al [17] investigate the multipath selection problem in concurrent multipath transfer and propose a path picking scheme to reduce the correlation level. Wang et al [18] propose a novel out-of-order scheduling approach for in-order arriving of the data chunks in CMT based on the progressive water-filling algorithm.…”
Section: Concurrent Multipath Transfermentioning
confidence: 99%
“…Prabhavat et al introduced a load distribution model E-DCLD [14] aiming to minimize the end-to-end delay difference and reduce the probability of reordering. Liao et al proposed OSIA [15] interleaving the sending time of multiple paths to align the packet arrival order. MPTCP itself includes a interesting congestion control mechanism [19] to schedule more data to the less congested paths than on the congested paths.…”
Section: A Cmt Researchmentioning
confidence: 99%