2019 European Conference on Networks and Communications (EuCNC) 2019
DOI: 10.1109/eucnc.2019.8802023
|View full text |Cite
|
Sign up to set email alerts
|

An Analytical Cross Layer Model for Multipath TCP (MPTCP)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…If the modeling can take into account the transmission instability that makes retransmissions impossible, then the time required for transmission can be more accurately estimated. Moreover, further rigorous research into the cross-layer approach to MPTCP [ 51 , 52 ] and channel modeling [ 53 ] has the potential to significantly improve performance when applying Conclone . Therefore, we will perform additional cross-layer analysis as future work that considers MPTCP, multiple interfaces, channel characteristics and their mutual influences, and then apply the results to ConClone .…”
Section: Discussionmentioning
confidence: 99%
“…If the modeling can take into account the transmission instability that makes retransmissions impossible, then the time required for transmission can be more accurately estimated. Moreover, further rigorous research into the cross-layer approach to MPTCP [ 51 , 52 ] and channel modeling [ 53 ] has the potential to significantly improve performance when applying Conclone . Therefore, we will perform additional cross-layer analysis as future work that considers MPTCP, multiple interfaces, channel characteristics and their mutual influences, and then apply the results to ConClone .…”
Section: Discussionmentioning
confidence: 99%
“…As an alternative method, we utilize a sequential greedy algorithm introduced in [42]. In order to convert (18) to a maximum weighted matching problem, we consider d i, j > 0 if d j ,i < 0 for all z ∈ Z . From each directed bilateral link pair, we extract an undirected link ⟨i, j ⟩ and its weight can be expressed as…”
Section: Distributed Schedulingmentioning
confidence: 99%
“…The scheduling demands in (18) is to maximize the weighted sum of the capacity of links. Equivalently, this problem can be solved by weighted matching problem rather than finding the maximum weighted of all independent set in the conflict graph.…”
Section: Distributed Schedulingmentioning
confidence: 99%
See 1 more Smart Citation