2010 IEEE 72nd Vehicular Technology Conference - Fall 2010
DOI: 10.1109/vetecf.2010.5594280
|View full text |Cite
|
Sign up to set email alerts
|

A Data-Scheduling Mechanism for Multi-Homed Mobile Terminals with Disparate Link Latencies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(27 citation statements)
references
References 7 publications
0
27
0
Order By: Relevance
“…Phatak et al [148,149], BAG [26,27], PRISM [103,104], ETOM [108], MAR [166], INTELiCON [121], MLP [51], SIMA [150], mHIP [64,151], Sun et al [189], LISP [55], OSCAR [66], LISP-HA [126] Transport BA-SCTP [13], W-SCTP [24], CMT-SCTP [8,46,47,48,49,88,89,90,119,175], LS-SCTP [5,6], cmpTCP [172], WiMP-SCTP [84], cmpSCTP [117], mSCTP-CMT [21], FPS-SCTP [128], R-MTP [120], Lee et al [110], pTCP [81,82,83], R 2 CP [80,105], Cetinkaya et al [25], mTCP [204], M-TCP [28], M/TCP [167], R-M/TCP [168], cTCP [45], MPL...…”
Section: Networkmentioning
confidence: 99%
“…Phatak et al [148,149], BAG [26,27], PRISM [103,104], ETOM [108], MAR [166], INTELiCON [121], MLP [51], SIMA [150], mHIP [64,151], Sun et al [189], LISP [55], OSCAR [66], LISP-HA [126] Transport BA-SCTP [13], W-SCTP [24], CMT-SCTP [8,46,47,48,49,88,89,90,119,175], LS-SCTP [5,6], cmpTCP [172], WiMP-SCTP [84], cmpSCTP [117], mSCTP-CMT [21], FPS-SCTP [128], R-MTP [120], Lee et al [110], pTCP [81,82,83], R 2 CP [80,105], Cetinkaya et al [25], mTCP [204], M-TCP [28], M/TCP [167], R-M/TCP [168], cTCP [45], MPL...…”
Section: Networkmentioning
confidence: 99%
“…Round robin is the simplest flow scheduling technique but it does not take into account the heterogeneous path characteristics (e.g., available bandwidth, RTT, and size of congestion window). Thus weighted round robin (WRR), earliest delivery path first (EDPF) [66], and forward prediction scheduling (FPS) [77] have been proposed to reduce packet reordering at the receiver. Let us briefly overview the afore-named flow scheduling techniques.…”
Section: A Stream Control Transmission Protocol (Sctp)mentioning
confidence: 99%
“…Because of the great similarities in adopted congestion control protocols between an SCTP stream and a TCP connection, SCTP extensions attempt to address the same challenges discussed in Section 2.2.1 while extending their congestion control mechanism. Similar to extending the congestion control of TCP, many solutions implement the standard SCTP stream congestion control mechanism at each sub-stream independent of the other sub-streams [59,60,61,62,63,64,65]. On the other hand, other SCTP extensions deploy a congestion control mechanism on the whole stream [66,67].…”
Section: Utilizing Multi-homing Support In Existing Protocolsmentioning
confidence: 99%
“…This procedure is done for each chunk until the congestion windows of the available paths have been exhausted. FPS dynamically estimates the packet delivery time at each network interface and fills this difference with in-order data to avoid packet reordering [64]. Cross-layer FPS [63] extends FPS [64] using a cross-layering approach to include the MAC layer contention delays (ex.…”
Section: -Round Robinmentioning
confidence: 99%