2014 23rd International Conference on Computer Communication and Networks (ICCCN) 2014
DOI: 10.1109/icccn.2014.6911726
|View full text |Cite
|
Sign up to set email alerts
|

Fine-grained Forward Prediction based Dynamic Packet Scheduling Mechanism for multipath TCP in lossy networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 36 publications
(18 citation statements)
references
References 12 publications
0
18
0
Order By: Relevance
“…DPSAF is able to conduct fine-grained scheduling based on the amount of estimated data which is obtained by applying maximum likelihood estimation on all transmitting path and therefore is capable of responding quickly to network changes due to frequent feedback receptions. Ni et al [ 76 ] proposed a packet scheduling mechanism, called F2P-DPS in lossy networks. In addition to RTT and loss rate, it also takes congestion window size (cwnd) into consideration.…”
Section: Congestion Control and Schedulermentioning
confidence: 99%
“…DPSAF is able to conduct fine-grained scheduling based on the amount of estimated data which is obtained by applying maximum likelihood estimation on all transmitting path and therefore is capable of responding quickly to network changes due to frequent feedback receptions. Ni et al [ 76 ] proposed a packet scheduling mechanism, called F2P-DPS in lossy networks. In addition to RTT and loss rate, it also takes congestion window size (cwnd) into consideration.…”
Section: Congestion Control and Schedulermentioning
confidence: 99%
“…As Hwang et al point out in [219], waiting until the fastest path becomes free could be more efficient than immediately sending a packet on the slowest one if the difference between their RTTs is large enough. Even simple heuristics based on delay, transmission rate, and loss rate often perform better than the Lowest-RTT scheduler [196], [197].…”
Section: A Mptcpmentioning
confidence: 99%
“…These algorithms all use different design methods. The F 2 P-DPS [25] considers the TCP characteristics of the subflow and the packet loss rate of the path. The smoothed RTT obtained by the subflow and the packet loss rate are used to estimate the amount of data that the subflow may send in the future.…”
Section: A Existing Scheduling Algorithmsmentioning
confidence: 99%
“…The path scheduling algorithm is crucial for us to study MPTCP [21]. There are many existing scheduling algorithms, Like, Round-Robin (RR) [22], Constraint-based proactive scheduling (CP) [23], Highest Sending Rate (HSR) [24], Largest Window Space (LWS) [24], Lowest Time/Space (LTS) [24], Fine-grained forward Prediction based Dynamic Packet Scheduling (F 2 P-DPS) [25]. In this paper, we analyzed four widely-deployed scheduling algorithms, namely, LowRTT, OTIAS, DAPS and BLEST.…”
Section: Introductionmentioning
confidence: 99%